145,066
145,066 is a composite number, even.
145,066 (one hundred forty-five thousand sixty-six) is an even 6-digit number. It is a composite number with 4 divisors, and factors as 2 × 72,533. Written other ways, in hexadecimal, 0x236AA.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 22
- Digit product
- 0
- Digital root
- 4
- Palindrome
- No
- Bit width
- 18 bits
- Reversed
- 660,541
- Recamán's sequence
- a(218,284) = 145,066
- Square (n²)
- 21,044,144,356
- Cube (n³)
- 3,052,789,845,147,496
- Divisor count
- 4
- σ(n) — sum of divisors
- 217,602
- φ(n) — Euler's totient
- 72,532
- Sum of prime factors
- 72,535
Primality
Prime factorization: 2 × 72533
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√145,066 = [380; (1, 7, 50, 1, 1, 1, 12, 1, 2, 3, 22, 1, 3, 1, 1, 1, 2, 1, 1, 13, 3, 1, 2, 3, …)]
Representations
- In words
- one hundred forty-five thousand sixty-six
- Ordinal
- 145066th
- Binary
- 100011011010101010
- Octal
- 433252
- Hexadecimal
- 0x236AA
- Base64
- Ajaq
- One's complement
- 4,294,822,229 (32-bit)
- Scientific notation
- 1.45066 × 10⁵
- As a duration
- 145,066 s = 1 day, 16 hours, 17 minutes, 46 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 145066, here are decompositions:
- 3 + 145063 = 145066
- 23 + 145043 = 145066
- 29 + 145037 = 145066
- 59 + 145007 = 145066
- 83 + 144983 = 145066
- 149 + 144917 = 145066
- 167 + 144899 = 145066
- 179 + 144887 = 145066
Showing the first eight; more decompositions exist.
UTF-8 encoding: F0 A3 9A AA (4 bytes).
As an unsigned 32-bit integer, this is the IPv4 address 0.2.54.170.
- Address
- 0.2.54.170
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.2.54.170
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 145,066 and was likely granted around 1873.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 145066 first appears in π at position 680,671 of the decimal expansion (the 680,671ordinal-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.