Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …000011000110101111100 |
3 | 21002101111211102112110111 |
4 | 131020200200120311330 |
5 | 230300044012334322 |
6 | 4131412310315404 |
7 | 264432300153160 |
oct | 35104040306574 |
9 | 7071454375414 |
10 | 2002000121212 |
11 | 702052970523 |
12 | 284001958b64 |
13 | 116a31a51950 |
14 | 6cc7c37aca0 |
15 | 371238b6177 |
hex | 1d220818d7c |
2002000121212 has 24 divisors (see below), whose sum is σ = 4312000261856. Its totient is φ = 792000047808.
The previous prime is 2002000121161. The next prime is 2002000121257. The reversal of 2002000121212 is 2121210002002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2002000121192 and 2002000121201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2749999803 + ... + 2750000530.
Almost surely, 22002000121212 is an apocalyptic number.
It is an amenable number.
2002000121212 is an abundant number, since it is smaller than the sum of its proper divisors (2310000140644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002000121212 is a wasteful number, since it uses less digits than its factorization.
2002000121212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5500000357 (or 5500000355 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2002000121212 its reverse (2121210002002), we get a palindrome (4123210123214).
It can be divided in two parts, 2002000 and 121212, that added together give a palindrome (2123212).
The spelling of 2002000121212 in words is "two trillion, two billion, one hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •