132,859
132,859 is a prime, odd.
132,859 (one hundred thirty-two thousand eight hundred fifty-nine) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x206FB.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 28
- Digit product
- 2,160
- Digital root
- 1
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 958,231
- Square (n²)
- 17,651,513,881
- Cube (n³)
- 2,345,162,482,715,779
- Divisor count
- 2
- σ(n) — sum of divisors
- 132,860
- φ(n) — Euler's totient
- 132,858
Primality
132,859 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√132,859 = [364; (2, 145, 3, 2, 1, 28, 2, 5, 1, 2, 1, 5, 10, 1, 6, 1, 3, 4, 1, 1, 37, 1, 4, 2, …)]
Representations
- In words
- one hundred thirty-two thousand eight hundred fifty-nine
- Ordinal
- 132859th
- Binary
- 100000011011111011
- Octal
- 403373
- Hexadecimal
- 0x206FB
- Base64
- Agb7
- One's complement
- 4,294,834,436 (32-bit)
- Scientific notation
- 1.32859 × 10⁵
- As a duration
- 132,859 s = 1 day, 12 hours, 54 minutes, 19 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 9B BB (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.6.251.
- Address
- 0.2.6.251
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.6.251
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,859 and was likely granted around 1872.
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.