155,461
155,461 is a prime, odd.
155,461 (one hundred fifty-five thousand four 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, 0x25F45.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 22
- Digit product
- 600
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 164,551
- Recamán's sequence
- a(477,197) = 155,461
- Square (n²)
- 24,168,122,521
- Cube (n³)
- 3,757,200,495,237,181
- Divisor count
- 2
- σ(n) — sum of divisors
- 155,462
- φ(n) — Euler's totient
- 155,460
Primality
155,461 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√155,461 = [394; (3, 1, 1, 71, 8, 1, 1, 3, 1, 5, 1, 2, 1, 4, 2, 2, 2, 1, 1, 6, 1, 2, 1, 1, …)]
Representations
- In words
- one hundred fifty-five thousand four hundred sixty-one
- Ordinal
- 155461st
- Binary
- 100101111101000101
- Octal
- 457505
- Hexadecimal
- 0x25F45
- Base64
- Al9F
- One's complement
- 4,294,811,834 (32-bit)
- Scientific notation
- 1.55461 × 10⁵
- As a duration
- 155,461 s = 1 day, 19 hours, 11 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 A5 BD 85 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.95.69.
- Address
- 0.2.95.69
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.95.69
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 155,461 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.