145,471
145,471 is a prime, odd.
145,471 (one hundred forty-five thousand four hundred seventy-one) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x2383F.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 22
- Digit product
- 560
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 174,541
- Recamán's sequence
- a(217,474) = 145,471
- Square (n²)
- 21,161,811,841
- Cube (n³)
- 3,078,429,930,322,111
- Divisor count
- 2
- σ(n) — sum of divisors
- 145,472
- φ(n) — Euler's totient
- 145,470
Primality
145,471 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√145,471 = [381; (2, 2, 5, 1, 1, 1, 8, 8, 2, 1, 3, 2, 21, 2, 1, 4, 1, 1, 2, 3, 4, 6, 50, 1, …)]
Representations
- In words
- one hundred forty-five thousand four hundred seventy-one
- Ordinal
- 145471st
- Binary
- 100011100000111111
- Octal
- 434077
- Hexadecimal
- 0x2383F
- Base64
- Ajg/
- One's complement
- 4,294,821,824 (32-bit)
- Scientific notation
- 1.45471 × 10⁵
- As a duration
- 145,471 s = 1 day, 16 hours, 24 minutes, 31 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 A0 BF (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.56.63.
- Address
- 0.2.56.63
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.56.63
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,471 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.