Base | Representation |
---|---|
bin | 110000000001100000101001… |
… | …001001111100101110110000 |
3 | 1000200211110221012111221111220 |
4 | 300001200221021330232300 |
5 | 210140431041032101000 |
6 | 2025112311401305040 |
7 | 62326263515113215 |
oct | 6001405111745660 |
9 | 1020743835457456 |
10 | 211210002222000 |
11 | 61330728025931 |
12 | 1b831ab6495180 |
13 | 90b102ccb9a52 |
14 | 3a2289381bb0c |
15 | 19640cbd691a0 |
hex | c0182927cbb0 |
211210002222000 has 160 divisors (see below), whose sum is σ = 681601533709824. Its totient is φ = 56268036448000.
The previous prime is 211210002221993. The next prime is 211210002222001. The reversal of 211210002222000 is 222200012112.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (211210002222001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10885614 + ... + 23257613.
Almost surely, 2211210002222000 is an apocalyptic number.
211210002222000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211210002222000 is an abundant number, since it is smaller than the sum of its proper divisors (470391531487824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210002222000 is a wasteful number, since it uses less digits than its factorization.
211210002222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34144284 (or 34144268 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 211210002222000 its reverse (222200012112), we get a palindrome (211432202234112).
The spelling of 211210002222000 in words is "two hundred eleven trillion, two hundred ten billion, two million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •