Base | Representation |
---|---|
bin | 11110111000011100111… |
… | …111010110001000101010 |
3 | 21111212202210002210221020 |
4 | 132320130333112020222 |
5 | 234232231223241020 |
6 | 4302531511353310 |
7 | 306216046111524 |
oct | 36703477261052 |
9 | 7455683083836 |
10 | 2122200212010 |
11 | 74902476a83a |
12 | 2a3368682836 |
13 | 125179525728 |
14 | 74a020caa14 |
15 | 3a30b1e2c40 |
hex | 1ee1cfd622a |
2122200212010 has 128 divisors (see below), whose sum is σ = 5279007264768. Its totient is φ = 545729184000.
The previous prime is 2122200212003. The next prime is 2122200212059. The reversal of 2122200212010 is 102120022212.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 25829695 + ... + 25911725.
It is an arithmetic number, because the mean of its divisors is an integer number (41242244256).
Almost surely, 22122200212010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2122200212010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2639503632384).
2122200212010 is an abundant number, since it is smaller than the sum of its proper divisors (3156807052758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122200212010 is a wasteful number, since it uses less digits than its factorization.
2122200212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82380.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2122200212010 its reverse (102120022212), we get a palindrome (2224320234222).
The spelling of 2122200212010 in words is "two trillion, one hundred twenty-two billion, two hundred million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •