130,453
130,453 is a composite number, odd.
130,453 (one hundred thirty thousand four hundred fifty-three) is an odd 6-digit number. It is a composite number with 4 divisors, and factors as 191 × 683. Written other ways, in hexadecimal, 0x1FD95.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 16
- Digit product
- 0
- Digital root
- 7
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 354,031
- Square (n²)
- 17,017,985,209
- Cube (n³)
- 2,220,047,224,469,677
- Divisor count
- 4
- σ(n) — sum of divisors
- 131,328
- φ(n) — Euler's totient
- 129,580
- Sum of prime factors
- 874
Primality
Prime factorization: 191 × 683
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√130,453 = [361; (5, 2, 8, 6, 1, 8, 1, 1, 10, 1, 15, 1, 1, 59, 1, 2, 6, 1, 24, 1, 14, 2, 2, 4, …)]
Representations
- In words
- one hundred thirty thousand four hundred fifty-three
- Ordinal
- 130453rd
- Binary
- 11111110110010101
- Octal
- 376625
- Hexadecimal
- 0x1FD95
- Base64
- Af2V
- One's complement
- 4,294,836,842 (32-bit)
- Scientific notation
- 1.30453 × 10⁵
- As a duration
- 130,453 s = 1 day, 12 hours, 14 minutes, 13 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.253.149.
- Address
- 0.1.253.149
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.253.149
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,453 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 130453 first appears in π at position 928,251 of the decimal expansion (the 928,251ordinal-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.