1736
1736 is the year Euler solved the Königsberg bridges problem.
- Even
- Composite
Where 1736 fits
Why 1736 is special
He proved no route could cross all seven bridges exactly once, and in doing so invented graph theory. The proof works by discarding the geography entirely and keeping only the connections.
Factors & digit properties
- Divisors (16)
- 1, 2, 4, 7, 8, 14, 28, 31, 56, 62, 124, 217, 248, 434, 868, 1736
- Prime factorisation
- 2^3 × 7 × 31
- Digit sum
- 17
- Digital root
- 8
Representations
- Decimal
- 1736
- Binary
- 11011001000
- Octal
- 3310
- Hexadecimal
- 6c8
- Roman numeral
- MDCCXXXVI
- Scientific notation
- 1.736 × 10^3
Other mathematical patterns
- Abundant number
Related numbers & connections
Euler's solution to the Königsberg bridges in 1736 created graph theory by discarding geography; the Pascal-Fermat letters of 1654 created probability from a gambling dispute. Both fields began from a puzzle.
View 1654 →Other connections
- is associated with1654
why?
Strength 0.50, confidence "high".
Mathematics
Euler's 1736 solution ignored distances and shapes and considered only which land masses connected to which. That abstraction created graph theory and underlies every network analysis since.
DocumentedMathematicsGeography: KönigsbergPeriod: 1736
Common questions
Is 1736 a prime number?
No, 1736 is not prime.
What are the factors of 1736?
The factors of 1736 are 1, 2, 4, 7, 8, 14, 28, 31, 56, 62, 124, 217, 248, 434, 868, 1736.
What is 1736 in Roman numerals?
1736 in Roman numerals is MDCCXXXVI.
About this page's data
Mathematical facts:computed directly from the number's value — nothing to source or verify externally.
Contextual records: 1 reviewer-confirmed record, sourced and reviewed before publication.
Last reviewed: 3 August 2026