Base | Representation |
---|---|
bin | 11101100011110100000… |
… | …110111110001100011111 |
3 | 21012012012012000022212102 |
4 | 131203310012332030133 |
5 | 231240120412011111 |
6 | 4153101525555315 |
7 | 266521001245553 |
oct | 35436406761437 |
9 | 7165165008772 |
10 | 2031320032031 |
11 | 713529224484 |
12 | 289824b75b3b |
13 | 1197252592c4 |
14 | 70460351863 |
15 | 37c8c95213b |
hex | 1d8f41be31f |
2031320032031 has 2 divisors, whose sum is σ = 2031320032032. Its totient is φ = 2031320032030.
The previous prime is 2031320032019. The next prime is 2031320032043. The reversal of 2031320032031 is 1302300231302.
It is a balanced prime because it is at equal distance from previous prime (2031320032019) and next prime (2031320032043).
It is a cyclic number.
It is not a de Polignac number, because 2031320032031 - 218 = 2031319769887 is a prime.
It is a super-2 number, since 2×20313200320312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2031320031994 and 2031320032012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2031320002031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015660016015 + 1015660016016.
It is an arithmetic number, because the mean of its divisors is an integer number (1015660016016).
Almost surely, 22031320032031 is an apocalyptic number.
2031320032031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031320032031 is an equidigital number, since it uses as much as digits as its factorization.
2031320032031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2031320032031 its reverse (1302300231302), we get a palindrome (3333620263333).
The spelling of 2031320032031 in words is "two trillion, thirty-one billion, three hundred twenty million, thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •