Base | Representation |
---|---|
bin | 100000000001000110001… |
… | …100110100001001101011 |
3 | 21210100002210101102002002 |
4 | 200001012030310021223 |
5 | 242022002430120021 |
6 | 4402431451401215 |
7 | 314650014045161 |
oct | 40010614641153 |
9 | 7710083342062 |
10 | 2200201020011 |
11 | 779111131325 |
12 | 2b64b6a5320b |
13 | 12c62a406ba7 |
14 | 786c153b231 |
15 | 3c373e0d50b |
hex | 2004633426b |
2200201020011 has 8 divisors (see below), whose sum is σ = 2202396404400. Its totient is φ = 2198006421088.
The previous prime is 2200201019911. The next prime is 2200201020023. The reversal of 2200201020011 is 1100201020022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2200201020011 - 222 = 2200196825707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2200201019974 and 2200201020001.
It is not an unprimeable number, because it can be changed into a prime (2200201020211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5490605 + ... + 5877681.
It is an arithmetic number, because the mean of its divisors is an integer number (275299550550).
Almost surely, 22200201020011 is an apocalyptic number.
2200201020011 is a deficient number, since it is larger than the sum of its proper divisors (2195384389).
2200201020011 is a wasteful number, since it uses less digits than its factorization.
2200201020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392733.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2200201020011 its sum of digits (11), we get a palindrome (2200201020022).
Adding to 2200201020011 its reverse (1100201020022), we get a palindrome (3300402040033).
The spelling of 2200201020011 in words is "two trillion, two hundred billion, two hundred one million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •