Base | Representation |
---|---|
bin | 1001010010011100001010… |
… | …0111010010000010111111 |
3 | 1100011021222212201002102212 |
4 | 2110213002213102002333 |
5 | 2314304444444340111 |
6 | 33415302440211035 |
7 | 2102551564424123 |
oct | 224470247220277 |
9 | 40137885632385 |
10 | 10212402340031 |
11 | 328806797a911 |
12 | 118b294a69a7b |
13 | 591043a8c928 |
14 | 2743d6441583 |
15 | 12a9ac10e98b |
hex | 949c29d20bf |
10212402340031 has 2 divisors, whose sum is σ = 10212402340032. Its totient is φ = 10212402340030.
The previous prime is 10212402340009. The next prime is 10212402340033. The reversal of 10212402340031 is 13004320421201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10212402340031 - 26 = 10212402339967 is a prime.
It is a super-2 number, since 2×102124023400312 (a number of 27 digits) contains 22 as substring.
Together with 10212402340033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10212402339979 and 10212402340006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212402340033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106201170015 + 5106201170016.
It is an arithmetic number, because the mean of its divisors is an integer number (5106201170016).
Almost surely, 210212402340031 is an apocalyptic number.
10212402340031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212402340031 is an equidigital number, since it uses as much as digits as its factorization.
10212402340031 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 10212402340031 its reverse (13004320421201), we get a palindrome (23216722761232).
The spelling of 10212402340031 in words is "ten trillion, two hundred twelve billion, four hundred two million, three hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •