Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0111001100011010110011 |
3 | 1100012001011011011120012111 |
4 | 2110232110013030122303 |
5 | 2314421443300023102 |
6 | 33423033422510151 |
7 | 2103246245403562 |
oct | 224562407143263 |
9 | 40161134146174 |
10 | 10220212111027 |
11 | 3290405329406 |
12 | 11908b4435357 |
13 | 5919b9a89cb9 |
14 | 27493774bbd9 |
15 | 12acb7a80cd7 |
hex | 94b941cc6b3 |
10220212111027 has 2 divisors, whose sum is σ = 10220212111028. Its totient is φ = 10220212111026.
The previous prime is 10220212110989. The next prime is 10220212111051. The reversal of 10220212111027 is 72011121202201.
It is a strong prime.
It is an emirp because it is prime and its reverse (72011121202201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10220212111027 - 223 = 10220203722419 is a prime.
It is a super-3 number, since 3×102202121110273 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10220212110989 and 10220212111007.
It is not a weakly prime, because it can be changed into another prime (10220212118027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110106055513 + 5110106055514.
It is an arithmetic number, because the mean of its divisors is an integer number (5110106055514).
Almost surely, 210220212111027 is an apocalyptic number.
10220212111027 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220212111027 is an equidigital number, since it uses as much as digits as its factorization.
10220212111027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 10220212111027 its reverse (72011121202201), we get a palindrome (82231333313228).
The spelling of 10220212111027 in words is "ten trillion, two hundred twenty billion, two hundred twelve million, one hundred eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •