Base | Representation |
---|---|
bin | 1110001111111000100111… |
… | …11100110000110100011111 |
3 | 11002221022200101121011202112 |
4 | 13013330103330300310133 |
5 | 13101321141001320111 |
6 | 150345435553544235 |
7 | 6412446112156064 |
oct | 707742374606437 |
9 | 132838611534675 |
10 | 31332121120031 |
11 | 9a8a972600136 |
12 | 362045bb7507b |
13 | 14637b61a2794 |
14 | 7a46a8966c6b |
15 | 395048b62e8b |
hex | 1c7f13f30d1f |
31332121120031 has 2 divisors, whose sum is σ = 31332121120032. Its totient is φ = 31332121120030.
The previous prime is 31332121120009. The next prime is 31332121120039. The reversal of 31332121120031 is 13002112123313.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31332121120031 - 26 = 31332121119967 is a prime.
It is a super-2 number, since 2×313321211200312 (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 = 31332121119979 and 31332121120006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31332121120039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15666060560015 + 15666060560016.
It is an arithmetic number, because the mean of its divisors is an integer number (15666060560016).
Almost surely, 231332121120031 is an apocalyptic number.
31332121120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
31332121120031 is an equidigital number, since it uses as much as digits as its factorization.
31332121120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31332121120031 its reverse (13002112123313), we get a palindrome (44334233243344).
The spelling of 31332121120031 in words is "thirty-one trillion, three hundred thirty-two billion, one hundred twenty-one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •