Base | Representation |
---|---|
bin | 1110001100011011111011… |
… | …10101010100001101101101 |
3 | 11002111222212010120212000002 |
4 | 13012031331311110031231 |
5 | 13042401012421442321 |
6 | 150215203023314045 |
7 | 6401053026225041 |
oct | 706157565241555 |
9 | 132458763525002 |
10 | 31213638468461 |
11 | 9a446a21a5389 |
12 | 36014b444b925 |
13 | 1455583472c27 |
14 | 79ca68d5c021 |
15 | 391e11ed220b |
hex | 1c637dd5436d |
31213638468461 has 2 divisors, whose sum is σ = 31213638468462. Its totient is φ = 31213638468460.
The previous prime is 31213638468421. The next prime is 31213638468473. The reversal of 31213638468461 is 16486483631213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16028861003236 + 15184777465225 = 4003606^2 + 3896765^2 .
It is a cyclic number.
It is not a de Polignac number, because 31213638468461 - 234 = 31196458599277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31213638468397 and 31213638468406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31213638468421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15606819234230 + 15606819234231.
It is an arithmetic number, because the mean of its divisors is an integer number (15606819234231).
Almost surely, 231213638468461 is an apocalyptic number.
It is an amenable number.
31213638468461 is a deficient number, since it is larger than the sum of its proper divisors (1).
31213638468461 is an equidigital number, since it uses as much as digits as its factorization.
31213638468461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11943936, while the sum is 56.
The spelling of 31213638468461 in words is "thirty-one trillion, two hundred thirteen billion, six hundred thirty-eight million, four hundred sixty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •