Base | Representation |
---|---|
bin | 1001001100001110010100… |
… | …00011010110000100000001 |
3 | 2122120011200001020002212122 |
4 | 10212013022003112010001 |
5 | 10122120030004031423 |
6 | 110552522510534025 |
7 | 4154132435641145 |
oct | 446071203260401 |
9 | 78504601202778 |
10 | 20211211002113 |
11 | 649258778403a |
12 | 2325099807315 |
13 | b37ba8167571 |
14 | 4dc329257225 |
15 | 250b176788c8 |
hex | 1261ca0d6101 |
20211211002113 has 2 divisors, whose sum is σ = 20211211002114. Its totient is φ = 20211211002112.
The previous prime is 20211211002071. The next prime is 20211211002193. The reversal of 20211211002113 is 31120011211202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13110648864769 + 7100562137344 = 3620863^2 + 2664688^2 .
It is a cyclic number.
It is not a de Polignac number, because 20211211002113 - 234 = 20194031132929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20211211002091 and 20211211002100.
It is not a weakly prime, because it can be changed into another prime (20211211002193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10105605501056 + 10105605501057.
It is an arithmetic number, because the mean of its divisors is an integer number (10105605501057).
Almost surely, 220211211002113 is an apocalyptic number.
It is an amenable number.
20211211002113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20211211002113 is an equidigital number, since it uses as much as digits as its factorization.
20211211002113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 20211211002113 its reverse (31120011211202), we get a palindrome (51331222213315).
The spelling of 20211211002113 in words is "twenty trillion, two hundred eleven billion, two hundred eleven million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •