Base | Representation |
---|---|
bin | 1001010010011011110010… |
… | …0011001011011111110011 |
3 | 1100011021201210021020011212 |
4 | 2110212330203023133303 |
5 | 2314304242423220311 |
6 | 33415244403430335 |
7 | 2102546220600623 |
oct | 224467443133763 |
9 | 40137653236155 |
10 | 10212300601331 |
11 | 3288015501044 |
12 | 118b2669853ab |
13 | 59102898a90a |
14 | 2743c6b1a883 |
15 | 12a9a3214c8b |
hex | 949bc8cb7f3 |
10212300601331 has 2 divisors, whose sum is σ = 10212300601332. Its totient is φ = 10212300601330.
The previous prime is 10212300601297. The next prime is 10212300601333. The reversal of 10212300601331 is 13310600321201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10212300601331 is a prime.
It is a super-2 number, since 2×102123006013312 (a number of 27 digits) contains 22 as substring.
Together with 10212300601333, 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 = 10212300601297 and 10212300601306.
It is not a weakly prime, because it can be changed into another prime (10212300601333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106150300665 + 5106150300666.
It is an arithmetic number, because the mean of its divisors is an integer number (5106150300666).
Almost surely, 210212300601331 is an apocalyptic number.
10212300601331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212300601331 is an equidigital number, since it uses as much as digits as its factorization.
10212300601331 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 10212300601331 its reverse (13310600321201), we get a palindrome (23522900922532).
The spelling of 10212300601331 in words is "ten trillion, two hundred twelve billion, three hundred million, six hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •