Base | Representation |
---|---|
bin | 100000000001000000001… |
… | …100100110010011101100 |
3 | 21210022211202212022012202 |
4 | 200001000030212103230 |
5 | 242021301134100022 |
6 | 4402413452521032 |
7 | 314644351663646 |
oct | 40010014462354 |
9 | 7708752768182 |
10 | 2200100300012 |
11 | 77906a29895a |
12 | 2b6489180178 |
13 | 12c6125a0764 |
14 | 786b1ddd896 |
15 | 3c36a165592 |
hex | 200403264ec |
2200100300012 has 12 divisors (see below), whose sum is σ = 3862555512816. Its totient is φ = 1096513010640.
The previous prime is 2200100300011. The next prime is 2200100300017. The reversal of 2200100300012 is 2100030010022.
It is a happy number.
It is a super-2 number, since 2×22001003000122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2200100299966 and 2200100300002.
It is not an unprimeable number, because it can be changed into a prime (2200100300011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 884283443 + ... + 884285930.
It is an arithmetic number, because the mean of its divisors is an integer number (321879626068).
Almost surely, 22200100300012 is an apocalyptic number.
It is an amenable number.
2200100300012 is a deficient number, since it is larger than the sum of its proper divisors (1662455212804).
2200100300012 is a wasteful number, since it uses less digits than its factorization.
2200100300012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1768569688 (or 1768569686 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 2200100300012 its reverse (2100030010022), we get a palindrome (4300130310034).
The spelling of 2200100300012 in words is "two trillion, two hundred billion, one hundred million, three hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •