Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01010011010100110100011 |
3 | 2122011122020122121100102222 |
4 | 10210200202022122212203 |
5 | 10113313342121213102 |
6 | 110430140421301255 |
7 | 4143152005510565 |
oct | 444404212324643 |
9 | 78148218540388 |
10 | 20101020101027 |
11 | 644a8818a6138 |
12 | 2307866b6482b |
13 | b2a69724aa48 |
14 | 4d6c7497d335 |
15 | 24cd18922aa2 |
hex | 12482229a9a3 |
20101020101027 has 2 divisors, whose sum is σ = 20101020101028. Its totient is φ = 20101020101026.
The previous prime is 20101020100969. The next prime is 20101020101033. The reversal of 20101020101027 is 72010102010102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20101020101027 - 26 = 20101020100963 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101020100996 and 20101020101014.
It is not a weakly prime, because it can be changed into another prime (20101020104027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050510050513 + 10050510050514.
It is an arithmetic number, because the mean of its divisors is an integer number (10050510050514).
Almost surely, 220101020101027 is an apocalyptic number.
20101020101027 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101020101027 is an equidigital number, since it uses as much as digits as its factorization.
20101020101027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 20101020101027 its reverse (72010102010102), we get a palindrome (92111122111129).
The spelling of 20101020101027 in words is "twenty trillion, one hundred one billion, twenty million, one hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •