Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …000010111000110001100 |
3 | 21002101111222100201101220 |
4 | 131020200220113012030 |
5 | 230300100031224322 |
6 | 4131412423203340 |
7 | 264432324006363 |
oct | 35104050270614 |
9 | 7071458321356 |
10 | 2002002211212 |
11 | 7020540687a3 |
12 | 2840025a6550 |
13 | 116a32304033 |
14 | 6cc7c7627da |
15 | 37123b7a55c |
hex | 1d220a1718c |
2002002211212 has 24 divisors (see below), whose sum is σ = 4750513723200. Its totient is φ = 656023323216.
The previous prime is 2002002211207. The next prime is 2002002211217. The reversal of 2002002211212 is 2121122002002.
It is an interprime number because it is at equal distance from previous prime (2002002211207) and next prime (2002002211217).
It is a junction number, because it is equal to n+sod(n) for n = 2002002211191 and 2002002211200.
It is not an unprimeable number, because it can be changed into a prime (2002002211217) 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, 1413842662 + ... + 1413844077.
It is an arithmetic number, because the mean of its divisors is an integer number (197938071800).
Almost surely, 22002002211212 is an apocalyptic number.
It is an amenable number.
2002002211212 is an abundant number, since it is smaller than the sum of its proper divisors (2748511511988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002002211212 is a wasteful number, since it uses less digits than its factorization.
2002002211212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2827686805 (or 2827686803 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2002002211212 its reverse (2121122002002), we get a palindrome (4123124213214).
The spelling of 2002002211212 in words is "two trillion, two billion, two million, two hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •