134,962
134,962 is a composite number, even.
134,962 (one hundred thirty-four thousand nine hundred sixty-two) is an even 6-digit number. It is a composite number with 4 divisors, and factors as 2 × 67,481. Written other ways, in hexadecimal, 0x20F32.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 25
- Digit product
- 1,296
- Digital root
- 7
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 269,431
- Square (n²)
- 18,214,741,444
- Cube (n³)
- 2,458,297,934,765,128
- Divisor count
- 4
- σ(n) — sum of divisors
- 202,446
- φ(n) — Euler's totient
- 67,480
- Sum of prime factors
- 67,483
Primality
Prime factorization: 2 × 67481
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√134,962 = [367; (2, 1, 2, 4, 2, 2, 1, 14, 1, 11, 1, 20, 1, 2, 5, 40, 1, 1, 1, 2, 1, 1, 14, 2, …)]
Representations
- In words
- one hundred thirty-four thousand nine hundred sixty-two
- Ordinal
- 134962nd
- Binary
- 100000111100110010
- Octal
- 407462
- Hexadecimal
- 0x20F32
- Base64
- Ag8y
- One's complement
- 4,294,832,333 (32-bit)
- Scientific notation
- 1.34962 × 10⁵
- As a duration
- 134,962 s = 1 day, 13 hours, 29 minutes, 22 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 134962, here are decompositions:
- 11 + 134951 = 134962
- 41 + 134921 = 134962
- 53 + 134909 = 134962
- 89 + 134873 = 134962
- 173 + 134789 = 134962
- 263 + 134699 = 134962
- 281 + 134681 = 134962
- 293 + 134669 = 134962
Showing the first eight; more decompositions exist.
UTF-8 encoding: F0 A0 BC B2 (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.15.50.
- Address
- 0.2.15.50
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.15.50
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 134,962 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 134962 first appears in π at position 475,709 of the decimal expansion (the 475,709ordinal-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.