Base | Representation |
---|---|
bin | 11101001000101101001… |
… | …000101001000111010011 |
3 | 21002102001121010002210211 |
4 | 131020231020221013103 |
5 | 230301012233001321 |
6 | 4131445315504551 |
7 | 264440452124203 |
oct | 35105510510723 |
9 | 7072047102724 |
10 | 2002212000211 |
11 | 702151527335 |
12 | 2840608b8157 |
13 | 116a66907b37 |
14 | 6cc9c572403 |
15 | 371372ba0e1 |
hex | 1d22d2291d3 |
2002212000211 has 8 divisors (see below), whose sum is σ = 2120004010080. Its totient is φ = 1884421638528.
The previous prime is 2002212000209. The next prime is 2002212000233. The reversal of 2002212000211 is 1120002122002.
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 2002212000211 - 21 = 2002212000209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002212000191 and 2002212000200.
It is not an unprimeable number, because it can be changed into a prime (2002212000281) 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 7 ways as a sum of consecutive naturals, for example, 2808085 + ... + 3448153.
It is an arithmetic number, because the mean of its divisors is an integer number (265000501260).
Almost surely, 22002212000211 is an apocalyptic number.
2002212000211 is a deficient number, since it is larger than the sum of its proper divisors (117792009869).
2002212000211 is a wasteful number, since it uses less digits than its factorization.
2002212000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824093.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2002212000211 its reverse (1120002122002), we get a palindrome (3122214122213).
The spelling of 2002212000211 in words is "two trillion, two billion, two hundred twelve million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •