Base | Representation |
---|---|
bin | 110010000010111000010010… |
… | …110101101010111000111100 |
3 | 1001212022101010002002121020011 |
4 | 302002320102311222320330 |
5 | 212322110212242010022 |
6 | 2100040350214033004 |
7 | 64234500250250521 |
oct | 6202702265527074 |
9 | 1055271102077204 |
10 | 220100210110012 |
11 | 64148a7a674221 |
12 | 20828a8b048764 |
13 | 95a748c7692ab |
14 | 3c4cc9ab97148 |
15 | 1a6a4a1814977 |
hex | c82e12d6ae3c |
220100210110012 has 48 divisors (see below), whose sum is σ = 393950788912800. Its totient is φ = 107569764605952.
The previous prime is 220100210109953. The next prime is 220100210110013. The reversal of 220100210110012 is 210011012001022.
It is a junction number, because it is equal to n+sod(n) for n = 220100210109974 and 220100210110001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220100210110013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36192748 + ... + 41834380.
It is an arithmetic number, because the mean of its divisors is an integer number (8207308102350).
Almost surely, 2220100210110012 is an apocalyptic number.
It is an amenable number.
220100210110012 is a deficient number, since it is larger than the sum of its proper divisors (173850578802788).
220100210110012 is a wasteful number, since it uses less digits than its factorization.
220100210110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5642830 (or 5642828 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220100210110012 its reverse (210011012001022), we get a palindrome (430111222111034).
The spelling of 220100210110012 in words is "two hundred twenty trillion, one hundred billion, two hundred ten million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •