Base | Representation |
---|---|
bin | 100000000010000010010… |
… | …110100111011010000011 |
3 | 21210102201010101012020100 |
4 | 200002002112213122003 |
5 | 242031034304102321 |
6 | 4403115542213443 |
7 | 315014020113510 |
oct | 40020226473203 |
9 | 7712633335210 |
10 | 2201210222211 |
11 | 77958986a930 |
12 | 2b6738a24283 |
13 | 12c75b516760 |
14 | 787795a2307 |
15 | 3c3d280b326 |
hex | 200825a7683 |
2201210222211 has 48 divisors (see below), whose sum is σ = 4269013781760. Its totient is φ = 1055525376960.
The previous prime is 2201210222149. The next prime is 2201210222227. The reversal of 2201210222211 is 1122220121022.
It is a happy number.
2201210222211 is a `hidden beast` number, since 2 + 20 + 1 + 210 + 222 + 211 = 666.
It is not a de Polignac number, because 2201210222211 - 213 = 2201210214019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2201210222231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 122158281 + ... + 122176298.
It is an arithmetic number, because the mean of its divisors is an integer number (88937787120).
Almost surely, 22201210222211 is an apocalyptic number.
2201210222211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2201210222211 is a deficient number, since it is larger than the sum of its proper divisors (2067803559549).
2201210222211 is a wasteful number, since it uses less digits than its factorization.
2201210222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244334616 (or 244334613 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2201210222211 its reverse (1122220121022), we get a palindrome (3323430343233).
The spelling of 2201210222211 in words is "two trillion, two hundred one billion, two hundred ten million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •