Base | Representation |
---|---|
bin | 110010000100100111110110… |
… | …111011101001111011111100 |
3 | 1001212201211022111210101101020 |
4 | 302010213312323221323330 |
5 | 212331041030224014322 |
6 | 2100211401040344140 |
7 | 64246240630110342 |
oct | 6204476673517374 |
9 | 1055654274711336 |
10 | 220220001001212 |
11 | 64194861494853 |
12 | 20848140915050 |
13 | 95b587052a334 |
14 | 3c549c2429992 |
15 | 1a6d66326205c |
hex | c849f6ee9efc |
220220001001212 has 48 divisors (see below), whose sum is σ = 526674088335360. Its totient is φ = 71585455378752.
The previous prime is 220220001001199. The next prime is 220220001001361. The reversal of 220220001001212 is 212100100022022.
It is a junction number, because it is equal to n+sod(n) for n = 220220001001191 and 220220001001200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 704647012 + ... + 704959467.
It is an arithmetic number, because the mean of its divisors is an integer number (10972376840320).
Almost surely, 2220220001001212 is an apocalyptic number.
It is an amenable number.
220220001001212 is an abundant number, since it is smaller than the sum of its proper divisors (306454087334148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220220001001212 is a wasteful number, since it uses less digits than its factorization.
220220001001212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1409606810 (or 1409606808 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220220001001212 its reverse (212100100022022), we get a palindrome (432320101023234).
The spelling of 220220001001212 in words is "two hundred twenty trillion, two hundred twenty billion, one million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.232 sec. • engine limits •