135,472
135,472 is a composite number, even.
135,472 (one hundred thirty-five thousand four hundred seventy-two) is an even 6-digit number. It is a composite number with 10 divisors, and factors as 2⁴ × 8,467. Written other ways, in hexadecimal, 0x21130.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 22
- Digit product
- 840
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 274,531
- Square (n²)
- 18,352,662,784
- Cube (n³)
- 2,486,271,932,674,048
- Divisor count
- 10
- σ(n) — sum of divisors
- 262,508
- φ(n) — Euler's totient
- 67,728
- Sum of prime factors
- 8,475
Primality
Prime factorization: 2 4 × 8467
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√135,472 = [368; (15, 2, 1, 81, 8, 2, 4, 2, 2, 8, 1, 2, 8, 8, 1, 1, 1, 4, 6, 2, 1, 3, 1, 7, …)]
Representations
- In words
- one hundred thirty-five thousand four hundred seventy-two
- Ordinal
- 135472nd
- Binary
- 100001000100110000
- Octal
- 410460
- Hexadecimal
- 0x21130
- Base64
- AhEw
- One's complement
- 4,294,831,823 (32-bit)
- Scientific notation
- 1.35472 × 10⁵
- As a duration
- 135,472 s = 1 day, 13 hours, 37 minutes, 52 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒌋𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓂍𓂍𓆼𓆼𓆼𓆼𓆼𓍢𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓎆𓎆𓏺𓏺
- Greek (Milesian)
- ͵ρλευοβʹ
- Mayan (base 20)
- 𝋰·𝋲·𝋭·𝋬
- Chinese
- 一十三萬五千四百七十二
- Chinese (financial)
- 壹拾參萬伍仟肆佰柒拾貳
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 135472, here are decompositions:
- 3 + 135469 = 135472
- 5 + 135467 = 135472
- 11 + 135461 = 135472
- 23 + 135449 = 135472
- 41 + 135431 = 135472
- 83 + 135389 = 135472
- 191 + 135281 = 135472
- 251 + 135221 = 135472
Showing the first eight; more decompositions exist.
UTF-8 encoding: F0 A1 84 B0 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.17.48.
- Address
- 0.2.17.48
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.17.48
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 135,472 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 135472 first appears in π at position 877,466 of the decimal expansion (the 877,466ordinal-suffix:th 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.