132,361
132,361 is a prime, odd.
132,361 (one hundred thirty-two thousand three hundred sixty-one) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x20509.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 108
- Digital root
- 7
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 163,231
- Recamán's sequence
- a(227,650) = 132,361
- Square (n²)
- 17,519,434,321
- Cube (n³)
- 2,318,889,846,161,881
- Divisor count
- 2
- σ(n) — sum of divisors
- 132,362
- φ(n) — Euler's totient
- 132,360
Primality
132,361 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√132,361 = [363; (1, 4, 2, 1, 1, 3, 1, 21, 3, 1, 2, 1, 9, 2, 1, 2, 5, 1, 2, 4, 2, 2, 9, 1, …)]
Representations
- In words
- one hundred thirty-two thousand three hundred sixty-one
- Ordinal
- 132361st
- Binary
- 100000010100001001
- Octal
- 402411
- Hexadecimal
- 0x20509
- Base64
- AgUJ
- One's complement
- 4,294,834,934 (32-bit)
- Scientific notation
- 1.32361 × 10⁵
- As a duration
- 132,361 s = 1 day, 12 hours, 46 minutes, 1 second
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 94 89 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.5.9.
- Address
- 0.2.5.9
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.5.9
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,361 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.