Base | Representation |
---|---|
bin | 11101100011111010000… |
… | …101000110000000000011 |
3 | 21012012110011111112121201 |
4 | 131203322011012000003 |
5 | 231240322032444021 |
6 | 4153115505002031 |
7 | 266523325552333 |
oct | 35437205060003 |
9 | 7165404445551 |
10 | 2031420203011 |
11 | 71357a822411 |
12 | 289852623317 |
13 | 11973cc2c884 |
14 | 7046d7890c3 |
15 | 37c9663c591 |
hex | 1d8fa146003 |
2031420203011 has 2 divisors, whose sum is σ = 2031420203012. Its totient is φ = 2031420203010.
The previous prime is 2031420202997. The next prime is 2031420203023. The reversal of 2031420203011 is 1103020241302.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2031420203011 - 27 = 2031420202883 is a prime.
It is a super-2 number, since 2×20314202030112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2031420203011.
It is not a weakly prime, because it can be changed into another prime (2031420293011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015710101505 + 1015710101506.
It is an arithmetic number, because the mean of its divisors is an integer number (1015710101506).
Almost surely, 22031420203011 is an apocalyptic number.
2031420203011 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031420203011 is an equidigital number, since it uses as much as digits as its factorization.
2031420203011 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 19.
Adding to 2031420203011 its reverse (1103020241302), we get a palindrome (3134440444313).
The spelling of 2031420203011 in words is "two trillion, thirty-one billion, four hundred twenty million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •