Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …1011000100001000010011 |
3 | 1100011021110220202000110022 |
4 | 2110212312223010020103 |
5 | 2314304042203130021 |
6 | 33415230522254055 |
7 | 2102543612543036 |
oct | 224466653041023 |
9 | 40137426660408 |
10 | 10212202005011 |
11 | 3287a74889186 |
12 | 118b23995732b |
13 | 591011418cb6 |
14 | 2743b79b301d |
15 | 12a99973b1ab |
hex | 949b6ac4213 |
10212202005011 has 2 divisors, whose sum is σ = 10212202005012. Its totient is φ = 10212202005010.
The previous prime is 10212202004993. The next prime is 10212202005013. The reversal of 10212202005011 is 11050020221201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10212202005011 - 222 = 10212197810707 is a prime.
It is a super-2 number, since 2×102122020050112 (a number of 27 digits) contains 22 as substring.
Together with 10212202005013, 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 (10212202005013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106101002505 + 5106101002506.
It is an arithmetic number, because the mean of its divisors is an integer number (5106101002506).
Almost surely, 210212202005011 is an apocalyptic number.
10212202005011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212202005011 is an equidigital number, since it uses as much as digits as its factorization.
10212202005011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 10212202005011 its reverse (11050020221201), we get a palindrome (21262222226212).
The spelling of 10212202005011 in words is "ten trillion, two hundred twelve billion, two hundred two million, five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •