Base | Representation |
---|---|
bin | 1001000110010111111011… |
… | …00101011010111100011111 |
3 | 2121211221212002100110011011 |
4 | 10203023331211122330133 |
5 | 10110321403300010421 |
6 | 110320321535040051 |
7 | 4133455465356436 |
oct | 443137545327437 |
9 | 77757762313134 |
10 | 20010212110111 |
11 | 6415313086563 |
12 | 22b2143670027 |
13 | b21c54c08642 |
14 | 4d26dc63611d |
15 | 24a7a16914e1 |
hex | 1232fd95af1f |
20010212110111 has 2 divisors, whose sum is σ = 20010212110112. Its totient is φ = 20010212110110.
The previous prime is 20010212110069. The next prime is 20010212110123. The reversal of 20010212110111 is 11101121201002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20010212110111 - 219 = 20010211585823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20010212110091 and 20010212110100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20010212140111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005106055055 + 10005106055056.
It is an arithmetic number, because the mean of its divisors is an integer number (10005106055056).
Almost surely, 220010212110111 is an apocalyptic number.
20010212110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010212110111 is an equidigital number, since it uses as much as digits as its factorization.
20010212110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20010212110111 its reverse (11101121201002), we get a palindrome (31111333311113).
The spelling of 20010212110111 in words is "twenty trillion, ten billion, two hundred twelve million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •