Base | Representation |
---|---|
bin | 100000000001000001011… |
… | …111110011010011100001 |
3 | 21210022220021220102112120 |
4 | 200001001133303103201 |
5 | 242021322230024301 |
6 | 4402415552214453 |
7 | 314645035245300 |
oct | 40010137632341 |
9 | 7708807812476 |
10 | 2200122111201 |
11 | 779080635a33 |
12 | 2b649453a429 |
13 | 12c616c693a1 |
14 | 786b4c7a437 |
15 | 3c36c022e36 |
hex | 200417f34e1 |
2200122111201 has 24 divisors (see below), whose sum is σ = 3414729479040. Its totient is φ = 1256367040992.
The previous prime is 2200122111179. The next prime is 2200122111211. The reversal of 2200122111201 is 1021112210022.
It is not a de Polignac number, because 2200122111201 - 25 = 2200122111169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2200122111211) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 4813966 + ... + 5251143.
It is an arithmetic number, because the mean of its divisors is an integer number (142280394960).
Almost surely, 22200122111201 is an apocalyptic number.
2200122111201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2200122111201 is a deficient number, since it is larger than the sum of its proper divisors (1214607367839).
2200122111201 is a wasteful number, since it uses less digits than its factorization.
2200122111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10066613 (or 10066606 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2200122111201 its reverse (1021112210022), we get a palindrome (3221234321223).
The spelling of 2200122111201 in words is "two trillion, two hundred billion, one hundred twenty-two million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •