145,207
145,207 is a prime, odd.
145,207 (one hundred forty-five thousand two hundred seven) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x23737.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 702,541
- Recamán's sequence
- a(218,002) = 145,207
- Square (n²)
- 21,085,072,849
- Cube (n³)
- 3,061,700,173,184,743
- Divisor count
- 2
- σ(n) — sum of divisors
- 145,208
- φ(n) — Euler's totient
- 145,206
Primality
145,207 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√145,207 = [381; (16, 1, 1, 3, 3, 1, 7, 2, 1, 13, 1, 2, 3, 13, 14, 26, 4, 1, 3, 1, 1, 1, 9, 7, …)]
Representations
- In words
- one hundred forty-five thousand two hundred seven
- Ordinal
- 145207th
- Binary
- 100011011100110111
- Octal
- 433467
- Hexadecimal
- 0x23737
- Base64
- Ajc3
- One's complement
- 4,294,822,088 (32-bit)
- Scientific notation
- 1.45207 × 10⁵
- As a duration
- 145,207 s = 1 day, 16 hours, 20 minutes, 7 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒌋 𒌋𒌋 𒁹𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓂍𓆼𓆼𓆼𓆼𓆼𓍢𓍢𓏺𓏺𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρμεσζʹ
- Mayan (base 20)
- 𝋲·𝋣·𝋠·𝋧
- Chinese
- 一十四萬五千二百零七
- Chinese (financial)
- 壹拾肆萬伍仟貳佰零柒
Also seen as
UTF-8 encoding: F0 A3 9C B7 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.55.55.
- Address
- 0.2.55.55
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.55.55
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 145,207 and was likely granted around 1873.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
Related reading
- Prime numbers — The building blocks of arithmetic: what primes are, why they matter, and how we find them.
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.