Base | Representation |
---|---|
bin | 1001001100001110010011… |
… | …11111111100110000010101 |
3 | 2122120011122222112212220021 |
4 | 10212013021333330300111 |
5 | 10122120024242041041 |
6 | 110552522435505141 |
7 | 4154132425243135 |
oct | 446071177746025 |
9 | 78504588485807 |
10 | 20211210112021 |
11 | 6492587226325 |
12 | 23250994581b1 |
13 | b37ba7c15396 |
14 | 4dc3290a4ac5 |
15 | 250b1754ecd1 |
hex | 1261c9ffcc15 |
20211210112021 has 2 divisors, whose sum is σ = 20211210112022. Its totient is φ = 20211210112020.
The previous prime is 20211210112013. The next prime is 20211210112097. The reversal of 20211210112021 is 12021101211202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10633664464900 + 9577545647121 = 3260930^2 + 3094761^2 .
It is a cyclic number.
It is not a de Polignac number, because 20211210112021 - 23 = 20211210112013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20211210111986 and 20211210112004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20211210119021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10105605056010 + 10105605056011.
It is an arithmetic number, because the mean of its divisors is an integer number (10105605056011).
Almost surely, 220211210112021 is an apocalyptic number.
It is an amenable number.
20211210112021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20211210112021 is an equidigital number, since it uses as much as digits as its factorization.
20211210112021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20211210112021 its reverse (12021101211202), we get a palindrome (32232311323223).
The spelling of 20211210112021 in words is "twenty trillion, two hundred eleven billion, two hundred ten million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •