Base | Representation |
---|---|
bin | 100000000001000000110… |
… | …101110101110000100001 |
3 | 21210022212112012120101011 |
4 | 200001000311311300201 |
5 | 242021311421024301 |
6 | 4402414520340521 |
7 | 314644542612313 |
oct | 40010065656041 |
9 | 7708775176334 |
10 | 2200111111201 |
11 | 779075402523 |
12 | 2b6490914741 |
13 | 12c6148b7603 |
14 | 786b36157b3 |
15 | 3c36b09da51 |
hex | 20040d75c21 |
2200111111201 has 8 divisors (see below), whose sum is σ = 2204742774024. Its totient is φ = 2195482675200.
The previous prime is 2200111111183. The next prime is 2200111111207. The reversal of 2200111111201 is 1021111110022.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1553251227025 + 646859884176 = 1246295^2 + 804276^2 .
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 2200111111201 - 27 = 2200111111073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2200111111207) 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, 560805 + ... + 2171341.
It is an arithmetic number, because the mean of its divisors is an integer number (275592846753).
Almost surely, 22200111111201 is an apocalyptic number.
It is an amenable number.
2200111111201 is a deficient number, since it is larger than the sum of its proper divisors (4631662823).
2200111111201 is a wasteful number, since it uses less digits than its factorization.
2200111111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1613411.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2200111111201 its reverse (1021111110022), we get a palindrome (3221222221223).
The spelling of 2200111111201 in words is "two trillion, two hundred billion, one hundred eleven million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •