Base | Representation |
---|---|
bin | 11101001001100011010… |
… | …100101100111100011101 |
3 | 21002111101221210202012101 |
4 | 131021203110230330131 |
5 | 230304343002200133 |
6 | 4132115433405101 |
7 | 264502131453142 |
oct | 35114324547435 |
9 | 7074357722171 |
10 | 2003121131293 |
11 | 702578725a37 |
12 | 284275269791 |
13 | 116b8007a719 |
14 | 6cd471c83c9 |
15 | 3718beec37d |
hex | 1d26352cf1d |
2003121131293 has 2 divisors, whose sum is σ = 2003121131294. Its totient is φ = 2003121131292.
The previous prime is 2003121131213. The next prime is 2003121131329. The reversal of 2003121131293 is 3921311213002.
Together with next prime (2003121131329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1134389015929 + 868732115364 = 1065077^2 + 932058^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2003121131293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2003121131213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001560565646 + 1001560565647.
It is an arithmetic number, because the mean of its divisors is an integer number (1001560565647).
Almost surely, 22003121131293 is an apocalyptic number.
It is an amenable number.
2003121131293 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003121131293 is an equidigital number, since it uses as much as digits as its factorization.
2003121131293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 28.
Adding to 2003121131293 its reverse (3921311213002), we get a palindrome (5924432344295).
The spelling of 2003121131293 in words is "two trillion, three billion, one hundred twenty-one million, one hundred thirty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •