129,049
129,049 is a prime, odd.
129,049 (one hundred twenty-nine thousand forty-nine) is an odd 6-digit number. It is a prime number — divisible only by 1 and itself. Written other ways, in hexadecimal, 0x1F819.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 25
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 940,921
- Recamán's sequence
- a(231,542) = 129,049
- Square (n²)
- 16,653,644,401
- Cube (n³)
- 2,149,136,156,304,649
- Divisor count
- 2
- σ(n) — sum of divisors
- 129,050
- φ(n) — Euler's totient
- 129,048
Primality
129,049 is prime. It has exactly two divisors: 1 and itself.
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√129,049 = [359; (4, 3, 1, 1, 1, 2, 1, 2, 2, 1, 2, 4, 2, 1, 4, 14, 1, 3, 12, 1, 1, 2, 1, 4, …)]
Representations
- In words
- one hundred twenty-nine thousand forty-nine
- Ordinal
- 129049th
- Binary
- 11111100000011001
- Octal
- 374031
- Hexadecimal
- 0x1F819
- Base64
- AfgZ
- One's complement
- 4,294,838,246 (32-bit)
- Scientific notation
- 1.29049 × 10⁵
- As a duration
- 129,049 s = 1 day, 11 hours, 50 minutes, 49 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 9F A0 99 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.1.248.25.
- Address
- 0.1.248.25
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.248.25
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 129,049 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.