Base | Representation |
---|---|
bin | 11101001001100011111… |
… | …110111110001110011001 |
3 | 21002111102201122201020102 |
4 | 131021203332332032121 |
5 | 230304403321241441 |
6 | 4132120511105145 |
7 | 264502324603565 |
oct | 35114376761631 |
9 | 7074381581212 |
10 | 2003132212121 |
11 | 702583a04147 |
12 | 284278b121b5 |
13 | 116b8245a221 |
14 | 6cd488706a5 |
15 | 3718ce8a69b |
hex | 1d263fbe399 |
2003132212121 has 2 divisors, whose sum is σ = 2003132212122. Its totient is φ = 2003132212120.
The previous prime is 2003132212117. The next prime is 2003132212139. The reversal of 2003132212121 is 1212122313002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1758305172121 + 244827040000 = 1326011^2 + 494800^2 .
It is a cyclic number.
It is not a de Polignac number, because 2003132212121 - 22 = 2003132212117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2003132212093 and 2003132212102.
It is not a weakly prime, because it can be changed into another prime (2003132212181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001566106060 + 1001566106061.
It is an arithmetic number, because the mean of its divisors is an integer number (1001566106061).
Almost surely, 22003132212121 is an apocalyptic number.
It is an amenable number.
2003132212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003132212121 is an equidigital number, since it uses as much as digits as its factorization.
2003132212121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2003132212121 its reverse (1212122313002), we get a palindrome (3215254525123).
The spelling of 2003132212121 in words is "two trillion, three billion, one hundred thirty-two million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •