132,607
132,607 is a prime, odd.
132,607 (one hundred thirty-two thousand six hundred seven) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x205FF.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 0
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 706,231
- Square (n²)
- 17,584,616,449
- Cube (n³)
- 2,331,843,233,452,543
- Divisor count
- 2
- σ(n) — sum of divisors
- 132,608
- φ(n) — Euler's totient
- 132,606
Primality
132,607 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√132,607 = [364; (6, 1, 1, 3, 1, 2, 23, 7, 2, 6, 1, 2, 1, 9, 1, 4, 2, 1, 2, 3, 4, 3, 1, 1, …)]
Representations
- In words
- one hundred thirty-two thousand six hundred seven
- Ordinal
- 132607th
- Binary
- 100000010111111111
- Octal
- 402777
- Hexadecimal
- 0x205FF
- Base64
- AgX/
- One's complement
- 4,294,834,688 (32-bit)
- Scientific notation
- 1.32607 × 10⁵
- As a duration
- 132,607 s = 1 day, 12 hours, 50 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 A0 97 BF (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.5.255.
- Address
- 0.2.5.255
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.5.255
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 132,607 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 132607 first appears in π at position 166,348 of the decimal expansion (the 166,348ordinal-suffix:th digit after the integer 3).
Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.
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.