Base | Representation |
---|---|
bin | 1001001001010111100101… |
… | …10010000111000001101001 |
3 | 2122012210110020002001002021 |
4 | 10210223302302013001221 |
5 | 10114013122141231441 |
6 | 110435500224104441 |
7 | 4144060422023311 |
oct | 444536262070151 |
9 | 78183406061067 |
10 | 20113110102121 |
11 | 6454a16339983 |
12 | 230a07ba65121 |
13 | b2b872c34b4a |
14 | 4d76a0508441 |
15 | 24d2c50203d1 |
hex | 124af2c87069 |
20113110102121 has 2 divisors, whose sum is σ = 20113110102122. Its totient is φ = 20113110102120.
The previous prime is 20113110102079. The next prime is 20113110102131. The reversal of 20113110102121 is 12120101131102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13027190862400 + 7085919239721 = 3609320^2 + 2661939^2 .
It is a cyclic number.
It is not a de Polignac number, because 20113110102121 - 217 = 20113109971049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20113110102095 and 20113110102104.
It is not a weakly prime, because it can be changed into another prime (20113110102131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056555051060 + 10056555051061.
It is an arithmetic number, because the mean of its divisors is an integer number (10056555051061).
Almost surely, 220113110102121 is an apocalyptic number.
It is an amenable number.
20113110102121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20113110102121 is an equidigital number, since it uses as much as digits as its factorization.
20113110102121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 20113110102121 its reverse (12120101131102), we get a palindrome (32233211233223).
The spelling of 20113110102121 in words is "twenty trillion, one hundred thirteen billion, one hundred ten million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •