164,623
164,623 is a prime, odd.
164,623 (one hundred sixty-four thousand six hundred twenty-three) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x2830F.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 22
- Digit product
- 864
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 326,461
- Recamán's sequence
- a(472,769) = 164,623
- Square (n²)
- 27,100,732,129
- Cube (n³)
- 4,461,403,825,272,367
- Divisor count
- 2
- σ(n) — sum of divisors
- 164,624
- φ(n) — Euler's totient
- 164,622
Primality
164,623 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√164,623 = [405; (1, 2, 1, 4, 3, 2, 4, 38, 2, 2, 2, 11, 2, 1, 9, 1, 2, 1, 2, 62, 17, 1, 1, 1, …)]
Representations
- In words
- one hundred sixty-four thousand six hundred twenty-three
- Ordinal
- 164623rd
- Binary
- 101000001100001111
- Octal
- 501417
- Hexadecimal
- 0x2830F
- Base64
- AoMP
- One's complement
- 4,294,802,672 (32-bit)
- Scientific notation
- 1.64623 × 10⁵
- As a duration
- 164,623 s = 1 day, 21 hours, 43 minutes, 43 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓂍𓂍𓂍𓆼𓆼𓆼𓆼𓍢𓍢𓍢𓍢𓍢𓍢𓎆𓎆𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρξδχκγʹ
- Chinese
- 一十六萬四千六百二十三
- Chinese (financial)
- 壹拾陸萬肆仟陸佰貳拾參
Also seen as
UTF-8 encoding: F0 A8 8C 8F (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.131.15.
- Address
- 0.2.131.15
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.131.15
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 164,623 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.