Base | Representation |
---|---|
bin | 1110010001110111110101… |
… | …11111111111010001111111 |
3 | 11010011211222101202222122012 |
4 | 13020323322333333101333 |
5 | 13103431031013341111 |
6 | 150441053231041435 |
7 | 6420414505160102 |
oct | 710737277772177 |
9 | 133154871688565 |
10 | 31400422012031 |
11 | a006931689216 |
12 | 363174197027b |
13 | 146a07c5c3887 |
14 | 7a7b07a4a739 |
15 | 396be4ee948b |
hex | 1c8efafff47f |
31400422012031 has 2 divisors, whose sum is σ = 31400422012032. Its totient is φ = 31400422012030.
The previous prime is 31400422012027. The next prime is 31400422012067. The reversal of 31400422012031 is 13021022400413.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 31400422012031 - 22 = 31400422012027 is a prime.
It is a super-2 number, since 2×314004220120312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 31400422011988 and 31400422012006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31400422012931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15700211006015 + 15700211006016.
It is an arithmetic number, because the mean of its divisors is an integer number (15700211006016).
Almost surely, 231400422012031 is an apocalyptic number.
31400422012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
31400422012031 is an equidigital number, since it uses as much as digits as its factorization.
31400422012031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 31400422012031 its reverse (13021022400413), we get a palindrome (44421444412444).
The spelling of 31400422012031 in words is "thirty-one trillion, four hundred billion, four hundred twenty-two million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •