1,052,568
1,052,568 is a composite number, even.
1,052,568 (one million fifty-two thousand five hundred sixty-eight) is an even 7-digit number. It is a composite number with 64 divisors, and factors as 2³ × 3³ × 11 × 443. Its proper divisors sum to 2,144,232, more than the number itself, making it an abundant number. Written other ways, in hexadecimal, 0x100F98.
Interestingness
Properties
- Parity
- Even
- Digit count
- 7
- Digit sum
- 27
- Digit product
- 0
- Digital root
- 9
- Palindrome
- No
- Bit width
- 21 bits
- Reversed
- 8,652,501
- Square (n²)
- 1,107,899,394,624
- Cube (n³)
- 1,166,139,450,000,594,432
- Divisor count
- 64
- σ(n) — sum of divisors
- 3,196,800
- φ(n) — Euler's totient
- 318,240
- Sum of prime factors
- 469
Primality
Prime factorization: 2 3 × 3 3 × 11 × 443
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√1,052,568 = [1025; (1, 17, 1, 2050)]
Period length 4 — the block in parentheses repeats forever.
Representations
- In words
- one million fifty-two thousand five hundred sixty-eight
- Ordinal
- 1052568th
- Binary
- 100000000111110011000
- Octal
- 4007630
- Hexadecimal
- 0x100F98
- Base64
- EA+Y
- One's complement
- 4,293,914,727 (32-bit)
- Scientific notation
- 1.052568 × 10⁶
- As a duration
- 1,052,568 s = 12 days, 4 hours, 22 minutes, 48 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 1052568, here are decompositions:
- 5 + 1052563 = 1052568
- 7 + 1052561 = 1052568
- 17 + 1052551 = 1052568
- 31 + 1052537 = 1052568
- 37 + 1052531 = 1052568
- 79 + 1052489 = 1052568
- 89 + 1052479 = 1052568
- 109 + 1052459 = 1052568
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.16.15.152.
- Address
- 0.16.15.152
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.16.15.152
Unspecified address (0.0.0.0/8) — "this network" placeholder.
Could be parsed as a date. Most likely interpretation: Tuesday, January 5, 2568 (MDDYYYY (US, single-digit month)).
Other possible interpretations (3)
- 2568-05-01 (DMMYYYY (Euro, single-digit day))
- 2568-10-05 (MMDYYYY (US, single-digit day))
- 2568-05-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,052,568 and was likely granted around 1912.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 1052568 first appears in π at position 25,605 of the decimal expansion (the 25,605ordinal-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°.