Base | Representation |
---|---|
bin | 1100110011111100011… |
… | …0100010010010011100 |
3 | 210001010021202121011202 |
4 | 3030333012202102130 |
5 | 12101232103310022 |
6 | 245040301535032 |
7 | 21621222134123 |
oct | 3147706422234 |
9 | 701107677152 |
10 | 220102010012 |
11 | 85387934915 |
12 | 367a7874478 |
13 | 179a8b92461 |
14 | a91db5caba |
15 | 5ad3140592 |
hex | 333f1a249c |
220102010012 has 6 divisors (see below), whose sum is σ = 385178517528. Its totient is φ = 110051005004.
The previous prime is 220102009997. The next prime is 220102010021. The reversal of 220102010012 is 210010201022.
It is a happy number.
220102010012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2201020100122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220102009975 and 220102010002.
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 as a sum of consecutive naturals, namely, 27512751248 + ... + 27512751255.
It is an arithmetic number, because the mean of its divisors is an integer number (64196419588).
Almost surely, 2220102010012 is an apocalyptic number.
It is an amenable number.
220102010012 is a deficient number, since it is larger than the sum of its proper divisors (165076507516).
220102010012 is a wasteful number, since it uses less digits than its factorization.
220102010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55025502507 (or 55025502505 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 220102010012 its reverse (210010201022), we get a palindrome (430112211034).
The spelling of 220102010012 in words is "two hundred twenty billion, one hundred two million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •