130,705
130,705 is a composite number, odd.
130,705 (one hundred thirty thousand seven hundred five) is an odd 6-digit number. It is a composite number with 4 divisors, and factors as 5 × 26,141. Written other ways, in hexadecimal, 0x1FE91.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 507,031
- Square (n²)
- 17,083,797,025
- Cube (n³)
- 2,232,937,690,152,625
- Divisor count
- 4
- σ(n) — sum of divisors
- 156,852
- φ(n) — Euler's totient
- 104,560
- Sum of prime factors
- 26,146
Primality
Prime factorization: 5 × 26141
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√130,705 = [361; (1, 1, 7, 2, 4, 12, 1, 2, 4, 1, 6, 7, 6, 2, 1, 2, 18, 5, 1, 33, 1, 1, 2, 11, …)]
Representations
- In words
- one hundred thirty thousand seven hundred five
- Ordinal
- 130705th
- Binary
- 11111111010010001
- Octal
- 377221
- Hexadecimal
- 0x1FE91
- Base64
- Af6R
- One's complement
- 4,294,836,590 (32-bit)
- Scientific notation
- 1.30705 × 10⁵
- As a duration
- 130,705 s = 1 day, 12 hours, 18 minutes, 25 seconds
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓍢𓍢𓍢𓍢𓍢𓍢𓍢𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ρλψεʹ
- Mayan (base 20)
- 𝋰·𝋦·𝋯·𝋥
- Chinese
- 一十三萬零七百零五
- Chinese (financial)
- 壹拾參萬零柒佰零伍
Also seen as
As an unsigned 32-bit integer, this is the IPv4 address 0.1.254.145.
- Address
- 0.1.254.145
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.254.145
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 130,705 and was likely granted around 1872.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 130705 first appears in π at position 586,771 of the decimal expansion (the 586,771ordinal-suffix:st digit after the integer 3).
Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.
Related reading
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.