1,000,052
1,000,052 is a composite number, even.
Interestingness
Properties
- Parity
- Even
- Digit count
- 7
- Digit sum
- 8
- Digit product
- 0
- Digital root
- 8
- Palindrome
- No
- Bit width
- 20 bits
- Reversed
- 2,500,001
- Square (n²)
- 1,000,104,002,704
- Cube (n³)
- 1,000,156,008,112,140,608
- Divisor count
- 6
- σ(n) — sum of divisors
- 1,750,098
- φ(n) — Euler's totient
- 500,024
- Sum of prime factors
- 250,017
Primality
Prime factorization: 2 2 × 250013
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√1,000,052 = [1000; (38, 2, 6, 11, 1, 2, 7, 1, 1, 1, 2, 25, 1, 1, 2, 17, 3, 3, 8, 1, 2, 68, 1, 1, …)]
Representations
- In words
- one million fifty-two
- Ordinal
- 1000052nd
- Binary
- 11110100001001110100
- Octal
- 3641164
- Hexadecimal
- 0xF4274
- Base64
- D0J0
- One's complement
- 4,293,967,243 (32-bit)
- Scientific notation
- 1.000052 × 10⁶
- As a duration
- 1,000,052 s = 11 days, 13 hours, 47 minutes, 32 seconds
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 1000052, here are decompositions:
- 13 + 1000039 = 1000052
- 19 + 1000033 = 1000052
- 73 + 999979 = 1000052
- 199 + 999853 = 1000052
- 283 + 999769 = 1000052
- 331 + 999721 = 1000052
- 421 + 999631 = 1000052
- 439 + 999613 = 1000052
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.15.66.116.
- Address
- 0.15.66.116
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.15.66.116
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 1,000,052 and was likely granted around 1911.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.