Base | Representation |
---|---|
bin | 11101001001011100110… |
… | …101100011000101010001 |
3 | 21002111010101000121021212 |
4 | 131021130311203011101 |
5 | 230304132122114022 |
6 | 4132100545025505 |
7 | 264466340433101 |
oct | 35113465430521 |
9 | 7074111017255 |
10 | 2003012301137 |
11 | 702522253261 |
12 | 284244925295 |
13 | 116b63664993 |
14 | 6cd36979201 |
15 | 371826a13e2 |
hex | 1d25cd63151 |
2003012301137 has 2 divisors, whose sum is σ = 2003012301138. Its totient is φ = 2003012301136.
The previous prime is 2003012301107. The next prime is 2003012301139. The reversal of 2003012301137 is 7311032103002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1569467750656 + 433544550481 = 1252784^2 + 658441^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2003012301137 is a prime.
It is a super-2 number, since 2×20030123011372 (a number of 25 digits) contains 22 as substring.
Together with 2003012301139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2003012301139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001506150568 + 1001506150569.
It is an arithmetic number, because the mean of its divisors is an integer number (1001506150569).
Almost surely, 22003012301137 is an apocalyptic number.
It is an amenable number.
2003012301137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003012301137 is an equidigital number, since it uses as much as digits as its factorization.
2003012301137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 2003012301137 its reverse (7311032103002), we get a palindrome (9314044404139).
The spelling of 2003012301137 in words is "two trillion, three billion, twelve million, three hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •