Base | Representation |
---|---|
bin | 11110100011111101101… |
… | …111110111000001001101 |
3 | 21102202222122010100012122 |
4 | 132203331233313001031 |
5 | 233402203003102341 |
6 | 4244452532542325 |
7 | 304506641561204 |
oct | 36437557670115 |
9 | 7382878110178 |
10 | 2100201222221 |
11 | 73a765924143 |
12 | 29b0491819a5 |
13 | 1230819684cb |
14 | 7391653023b |
15 | 3996ec1394b |
hex | 1e8fdbf704d |
2100201222221 has 2 divisors, whose sum is σ = 2100201222222. Its totient is φ = 2100201222220.
The previous prime is 2100201222211. The next prime is 2100201222257. The reversal of 2100201222221 is 1222221020012.
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., 1369157412100 + 731043810121 = 1170110^2 + 855011^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100201222221 - 26 = 2100201222157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2100201222221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100201222211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050100611110 + 1050100611111.
It is an arithmetic number, because the mean of its divisors is an integer number (1050100611111).
Almost surely, 22100201222221 is an apocalyptic number.
It is an amenable number.
2100201222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100201222221 is an equidigital number, since it uses as much as digits as its factorization.
2100201222221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2100201222221 its reverse (1222221020012), we get a palindrome (3322422242233).
The spelling of 2100201222221 in words is "two trillion, one hundred billion, two hundred one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •