Base | Representation |
---|---|
bin | 100000001011010001000… |
… | …101010011110100110010 |
3 | 21211101021211021220012220 |
4 | 200023101011103310302 |
5 | 242211333440121320 |
6 | 4411435221101510 |
7 | 315514432365354 |
oct | 40132105236462 |
9 | 7741254256186 |
10 | 2211121020210 |
11 | 782805199083 |
12 | 2b8643b57896 |
13 | 13067a8a127b |
14 | 790399450d4 |
15 | 3c7b2948e40 |
hex | 202d1153d32 |
2211121020210 has 32 divisors (see below), whose sum is σ = 5338467050112. Its totient is φ = 586101538560.
The previous prime is 2211121020193. The next prime is 2211121020233. The reversal of 2211121020210 is 120201211122.
It is a super-2 number, since 2×22111210202102 (a number of 25 digits) contains 22 as substring.
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 2211121020210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220665751 + ... + 220675770.
It is an arithmetic number, because the mean of its divisors is an integer number (166827095316).
Almost surely, 22211121020210 is an apocalyptic number.
2211121020210 is an abundant number, since it is smaller than the sum of its proper divisors (3127346029902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211121020210 is a wasteful number, since it uses less digits than its factorization.
2211121020210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441341698.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2211121020210 its reverse (120201211122), we get a palindrome (2331322231332).
The spelling of 2211121020210 in words is "two trillion, two hundred eleven billion, one hundred twenty-one million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •