Base | Representation |
---|---|
bin | 11101001001101000110… |
… | …011010010110111100111 |
3 | 21002111122100202001011121 |
4 | 131021220303102313213 |
5 | 230310040014141111 |
6 | 4132132515314411 |
7 | 264504325603663 |
oct | 35115063226747 |
9 | 7074570661147 |
10 | 2003213037031 |
11 | 702615599098 |
12 | 28429bbaba07 |
13 | 116b96118c0b |
14 | 6cd554ad8a3 |
15 | 37195103871 |
hex | 1d268cd2de7 |
2003213037031 has 2 divisors, whose sum is σ = 2003213037032. Its totient is φ = 2003213037030.
The previous prime is 2003213037019. The next prime is 2003213037043. The reversal of 2003213037031 is 1307303123002.
It is a balanced prime because it is at equal distance from previous prime (2003213037019) and next prime (2003213037043).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2003213037031 is a prime.
It is a super-2 number, since 2×20032130370312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2003213036987 and 2003213037005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2003214037031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001606518515 + 1001606518516.
It is an arithmetic number, because the mean of its divisors is an integer number (1001606518516).
Almost surely, 22003213037031 is an apocalyptic number.
2003213037031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003213037031 is an equidigital number, since it uses as much as digits as its factorization.
2003213037031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 25.
The spelling of 2003213037031 in words is "two trillion, three billion, two hundred thirteen million, thirty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •