Base | Representation |
---|---|
bin | 1001010010011011000010… |
… | …1110010110001111011011 |
3 | 1100011021012221221111220202 |
4 | 2110212300232112033123 |
5 | 2314303341130433311 |
6 | 33415212555212415 |
7 | 2102541261332111 |
oct | 224466056261733 |
9 | 40137187844822 |
10 | 10212102202331 |
11 | 3287a23511a27 |
12 | 118b21044710b |
13 | 590cc6844263 |
14 | 2743a8633ab1 |
15 | 12a990ac4e3b |
hex | 949b0b963db |
10212102202331 has 2 divisors, whose sum is σ = 10212102202332. Its totient is φ = 10212102202330.
The previous prime is 10212102202189. The next prime is 10212102202333. The reversal of 10212102202331 is 13320220121201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10212102202331 - 234 = 10194922333147 is a prime.
It is a super-2 number, since 2×102121022023312 (a number of 27 digits) contains 22 as substring.
Together with 10212102202333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10212102202333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106051101165 + 5106051101166.
It is an arithmetic number, because the mean of its divisors is an integer number (5106051101166).
Almost surely, 210212102202331 is an apocalyptic number.
10212102202331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212102202331 is an equidigital number, since it uses as much as digits as its factorization.
10212102202331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10212102202331 its reverse (13320220121201), we get a palindrome (23532322323532).
The spelling of 10212102202331 in words is "ten trillion, two hundred twelve billion, one hundred two million, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •