Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …001110100100111010010 |
3 | 21002012220220210022122020 |
4 | 131012312201310213102 |
5 | 230232423330042320 |
6 | 4130520033352310 |
7 | 264340240266360 |
oct | 35066641644722 |
9 | 7065826708566 |
10 | 2000222112210 |
11 | 701320266aa3 |
12 | 2837a6408696 |
13 | 11680a59130a |
14 | 6cb5018a630 |
15 | 3706c753940 |
hex | 1d1b68749d2 |
2000222112210 has 128 divisors (see below), whose sum is σ = 5503582554624. Its totient is φ = 455756544000.
The previous prime is 2000222112181. The next prime is 2000222112221. The reversal of 2000222112210 is 122112220002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2000222112210.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 222217710 + ... + 222226710.
It is an arithmetic number, because the mean of its divisors is an integer number (42996738708).
Almost surely, 22000222112210 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000222112210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2751791277312).
2000222112210 is an abundant number, since it is smaller than the sum of its proper divisors (3503360442414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000222112210 is a wasteful number, since it uses less digits than its factorization.
2000222112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12228.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2000222112210 its reverse (122112220002), we get a palindrome (2122334332212).
The spelling of 2000222112210 in words is "two trillion, two hundred twenty-two million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •