Base | Representation |
---|---|
bin | 11100111000111111… |
… | …110101101010001111 |
3 | 2222001220112121021012 |
4 | 130320333311222033 |
5 | 1002012340430111 |
6 | 22130104155435 |
7 | 2145505255535 |
oct | 347077655217 |
9 | 88056477235 |
10 | 31021030031 |
11 | 12179621002 |
12 | 6018a68b7b |
13 | 2c04a86494 |
14 | 1703cac155 |
15 | c185b148b |
hex | 738ff5a8f |
31021030031 has 2 divisors, whose sum is σ = 31021030032. Its totient is φ = 31021030030.
The previous prime is 31021030013. The next prime is 31021030037. The reversal of 31021030031 is 13003012013.
Together with previous prime (31021030013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31021030031 - 218 = 31020767887 is a prime.
It is a super-2 number, since 2×310210300312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31021029988 and 31021030015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31021030037) 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, 15510515015 + 15510515016.
It is an arithmetic number, because the mean of its divisors is an integer number (15510515016).
Almost surely, 231021030031 is an apocalyptic number.
31021030031 is a deficient number, since it is larger than the sum of its proper divisors (1).
31021030031 is an equidigital number, since it uses as much as digits as its factorization.
31021030031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 31021030031 its reverse (13003012013), we get a palindrome (44024042044).
The spelling of 31021030031 in words is "thirty-one billion, twenty-one million, thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •