Base | Representation |
---|---|
bin | 111111011011101… |
… | …001100101011100 |
3 | 2202011111121112221 |
4 | 333123221211130 |
5 | 4134414302303 |
6 | 253333435124 |
7 | 35241442210 |
oct | 7733514534 |
9 | 2664447487 |
10 | 1064212828 |
11 | 4a67a1938 |
12 | 25849baa4 |
13 | 13c630843 |
14 | a14a4940 |
15 | 636674bd |
hex | 3f6e995c |
1064212828 has 12 divisors (see below), whose sum is σ = 2128425712. Its totient is φ = 456091200.
The previous prime is 1064212813. The next prime is 1064212867. The reversal of 1064212828 is 8282124601.
1064212828 is an admirable number.
It is a super-2 number, since 2×10642128282 = 2265097886559515168, which contains 22 as substring.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1064212793 and 1064212802.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19003773 + ... + 19003828.
Almost surely, 21064212828 is an apocalyptic number.
It is an amenable number.
1064212828 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064212828 is a wasteful number, since it uses less digits than its factorization.
1064212828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38007612 (or 38007610 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 34.
The square root of 1064212828 is about 32622.2750279621. The cubic root of 1064212828 is about 1020.9618084005.
The spelling of 1064212828 in words is "one billion, sixty-four million, two hundred twelve thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •