Base | Representation |
---|---|
bin | 11101001000101101001… |
… | …000101001110100111101 |
3 | 21002102001121010020211001 |
4 | 131020231020221310331 |
5 | 230301012233100013 |
6 | 4131445315530301 |
7 | 264440452135546 |
oct | 35105510516475 |
9 | 7072047106731 |
10 | 2002212003133 |
11 | 702151529551 |
12 | 2840608b9991 |
13 | 116a66909274 |
14 | 6cc9c5734cd |
15 | 371372baddd |
hex | 1d22d229d3d |
2002212003133 has 2 divisors, whose sum is σ = 2002212003134. Its totient is φ = 2002212003132.
The previous prime is 2002212003131. The next prime is 2002212003167. The reversal of 2002212003133 is 3313002122002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1727155809369 + 275056193764 = 1314213^2 + 524458^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002212003133 - 21 = 2002212003131 is a prime.
Together with 2002212003131, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2002212003133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002212003131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001106001566 + 1001106001567.
It is an arithmetic number, because the mean of its divisors is an integer number (1001106001567).
Almost surely, 22002212003133 is an apocalyptic number.
It is an amenable number.
2002212003133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002212003133 is an equidigital number, since it uses as much as digits as its factorization.
2002212003133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2002212003133 its reverse (3313002122002), we get a palindrome (5315214125135).
The spelling of 2002212003133 in words is "two trillion, two billion, two hundred twelve million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •