Base | Representation |
---|---|
bin | 100000000000111010010… |
… | …001110011101000011011 |
3 | 21210022120212000102222000 |
4 | 200000322101303220123 |
5 | 242021100224031021 |
6 | 4402355544332043 |
7 | 314642034654261 |
oct | 40007221635033 |
9 | 7708525012860 |
10 | 2200001002011 |
11 | 77901923689a |
12 | 2b645ba74023 |
13 | 12c5c7b44647 |
14 | 786a2b52431 |
15 | 3c36159db26 |
hex | 2003a473a1b |
2200001002011 has 8 divisors (see below), whose sum is σ = 3259260743760. Its totient is φ = 1466667334656.
The previous prime is 2200001001973. The next prime is 2200001002019. The reversal of 2200001002011 is 1102001000022.
It is not a de Polignac number, because 2200001002011 - 217 = 2200000870939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2200001001984 and 2200001002002.
It is not an unprimeable number, because it can be changed into a prime (2200001002019) 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 7 ways as a sum of consecutive naturals, for example, 40740759270 + ... + 40740759323.
It is an arithmetic number, because the mean of its divisors is an integer number (407407592970).
Almost surely, 22200001002011 is an apocalyptic number.
2200001002011 is a deficient number, since it is larger than the sum of its proper divisors (1059259741749).
2200001002011 is an equidigital number, since it uses as much as digits as its factorization.
2200001002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81481518602 (or 81481518596 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2200001002011 its reverse (1102001000022), we get a palindrome (3302002002033).
The spelling of 2200001002011 in words is "two trillion, two hundred billion, one million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •