Base | Representation |
---|---|
bin | 11101011010001101101… |
… | …101101110001011101101 |
3 | 21011012120211000022121222 |
4 | 131122031231232023231 |
5 | 231103013110432341 |
6 | 4144235025233125 |
7 | 266004365163605 |
oct | 35321555561355 |
9 | 7135524008558 |
10 | 2021012202221 |
11 | 70a119778371 |
12 | 287828a927a5 |
13 | 11877185c21c |
14 | 6db6337bc05 |
15 | 37887a3a44b |
hex | 1d68db6e2ed |
2021012202221 has 2 divisors, whose sum is σ = 2021012202222. Its totient is φ = 2021012202220.
The previous prime is 2021012202211. The next prime is 2021012202299. The reversal of 2021012202221 is 1222022101202.
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., 1095685562500 + 925326639721 = 1046750^2 + 961939^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021012202221 - 214 = 2021012185837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2021012202221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021012202211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010506101110 + 1010506101111.
It is an arithmetic number, because the mean of its divisors is an integer number (1010506101111).
Almost surely, 22021012202221 is an apocalyptic number.
It is an amenable number.
2021012202221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021012202221 is an equidigital number, since it uses as much as digits as its factorization.
2021012202221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2021012202221 its reverse (1222022101202), we get a palindrome (3243034303423).
The spelling of 2021012202221 in words is "two trillion, twenty-one billion, twelve million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •