172,421
172,421 is a prime, odd.
172,421 (one hundred seventy-two thousand four hundred twenty-one) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x2A185.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 17
- Digit product
- 112
- Digital root
- 8
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 124,271
- Recamán's sequence
- a(190,922) = 172,421
- Square (n²)
- 29,729,001,241
- Cube (n³)
- 5,125,904,122,974,461
- Divisor count
- 2
- σ(n) — sum of divisors
- 172,422
- φ(n) — Euler's totient
- 172,420
Primality
172,421 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√172,421 = [415; (4, 4, 4, 5, 2, 28, 5, 1, 1, 5, 1, 165, 4, 22, 5, 8, 1, 4, 1, 5, 9, 1, 5, 33, …)]
Representations
- In words
- one hundred seventy-two thousand four hundred twenty-one
- Ordinal
- 172421st
- Binary
- 101010000110000101
- Octal
- 520605
- Hexadecimal
- 0x2A185
- Base64
- AqGF
- One's complement
- 4,294,794,874 (32-bit)
- Scientific notation
- 1.72421 × 10⁵
- As a duration
- 172,421 s = 1 day, 23 hours, 53 minutes, 41 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒌋𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓆼𓆼𓍢𓍢𓍢𓍢𓎆𓎆𓏺
- Greek (Milesian)
- ͵ροβυκαʹ
- Chinese
- 一十七萬二千四百二十一
- Chinese (financial)
- 壹拾柒萬貳仟肆佰貳拾壹
Also seen as
UTF-8 encoding: F0 AA 86 85 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.161.133.
- Address
- 0.2.161.133
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.161.133
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 172,421 and was likely granted around 1874.
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.