Base | Representation |
---|---|
bin | 1110001100010101001001… |
… | …11110011101110001001111 |
3 | 11002111122110120120020001121 |
4 | 13012022210332131301033 |
5 | 13042321040023223043 |
6 | 150213402015021411 |
7 | 6400563620443354 |
oct | 706124476356117 |
9 | 132448416506047 |
10 | 31210000211023 |
11 | 9a430a5526757 |
12 | 3600859b0a867 |
13 | 145512378948a |
14 | 79c801a9062b |
15 | 391c9c8b4ded |
hex | 1c62a4f9dc4f |
31210000211023 has 2 divisors, whose sum is σ = 31210000211024. Its totient is φ = 31210000211022.
The previous prime is 31210000211021. The next prime is 31210000211051. The reversal of 31210000211023 is 32011200001213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 31210000211023 - 21 = 31210000211021 is a prime.
It is a super-2 number, since 2×312100002110232 (a number of 28 digits) contains 22 as substring.
Together with 31210000211021, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 31210000210988 and 31210000211006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31210000211021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15605000105511 + 15605000105512.
It is an arithmetic number, because the mean of its divisors is an integer number (15605000105512).
Almost surely, 231210000211023 is an apocalyptic number.
31210000211023 is a deficient number, since it is larger than the sum of its proper divisors (1).
31210000211023 is an equidigital number, since it uses as much as digits as its factorization.
31210000211023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31210000211023 its reverse (32011200001213), we get a palindrome (63221200212236).
The spelling of 31210000211023 in words is "thirty-one trillion, two hundred ten billion, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •