1,020,066
1,020,066 is a composite number, even.
1,020,066 (one million twenty thousand sixty-six) is an even 7-digit number. It is a composite number with 16 divisors, and factors as 2 × 3 × 197 × 863. Its proper divisors sum to 1,032,798, more than the number itself, making it an abundant number. Written other ways, in hexadecimal, 0xF90A2.
Interestingness
Properties
- Parity
- Even
- Digit count
- 7
- Digit sum
- 15
- Digit product
- 0
- Digital root
- 6
- Palindrome
- No
- Bit width
- 20 bits
- Reversed
- 6,600,201
- Square (n²)
- 1,040,534,644,356
- Cube (n³)
- 1,061,414,012,529,647,496
- Divisor count
- 16
- σ(n) — sum of divisors
- 2,052,864
- φ(n) — Euler's totient
- 337,904
- Sum of prime factors
- 1,065
Primality
Prime factorization: 2 × 3 × 197 × 863
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√1,020,066 = [1009; (1, 58, 2, 2, 3, 6, 1, 2, 3, 1, 1, 8, 2, 36, 3, 1, 13, 1, 133, 1, 2, 1, 2, 1, …)]
Representations
- In words
- one million twenty thousand sixty-six
- Ordinal
- 1020066th
- Binary
- 11111001000010100010
- Octal
- 3710242
- Hexadecimal
- 0xF90A2
- Base64
- D5Ci
- One's complement
- 4,293,947,229 (32-bit)
- Scientific notation
- 1.020066 × 10⁶
- As a duration
- 1,020,066 s = 11 days, 19 hours, 21 minutes, 6 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹 𒌋𒌋𒁹 𒁹𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓁨𓂍𓂍𓎆𓎆𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺𓏺
- Chinese
- 一百零二萬零六十六
- Chinese (financial)
- 壹佰零貳萬零陸拾陸
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 1020066, here are decompositions:
- 7 + 1020059 = 1020066
- 17 + 1020049 = 1020066
- 23 + 1020043 = 1020066
- 29 + 1020037 = 1020066
- 43 + 1020023 = 1020066
- 53 + 1020013 = 1020066
- 59 + 1020007 = 1020066
- 139 + 1019927 = 1020066
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.15.144.162.
- Address
- 0.15.144.162
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.15.144.162
Unspecified address (0.0.0.0/8) — "this network" placeholder.
Could be parsed as a date. Most likely interpretation: Saturday, January 2, 0066 (MDDYYYY (US, single-digit month)).
Other possible interpretations (3)
- 0066-02-01 (DMMYYYY (Euro, single-digit day))
- 0066-10-02 (MMDYYYY (US, single-digit day))
- 0066-02-10 (DDMYYYY (Euro, single-digit month))
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 1,020,066 and was likely granted around 1911.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 1020066 first appears in π at position 289,987 of the decimal expansion (the 289,987ordinal-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
- Babylonian numerals — The base-60 cuneiform system that gave us 60 minutes, 60 seconds, and 360°.