Base | Representation |
---|---|
bin | 11110100101110110000… |
… | …101101110011100111101 |
3 | 21102222012100020001210100 |
4 | 132211312011232130331 |
5 | 233420321334021341 |
6 | 4245425135031313 |
7 | 304610656016562 |
oct | 36456605563475 |
9 | 7388170201710 |
10 | 2102220220221 |
11 | 740601567230 |
12 | 29b51136b539 |
13 | 123314034b94 |
14 | 73a68732869 |
15 | 39a3c0ca3b6 |
hex | 1e97616e73d |
2102220220221 has 96 divisors (see below), whose sum is σ = 3541095926784. Its totient is φ = 1189873152000.
The previous prime is 2102220220213. The next prime is 2102220220223. The reversal of 2102220220221 is 1220220222012.
2102220220221 is a `hidden beast` number, since 2 + 1 + 0 + 2 + 220 + 220 + 221 = 666.
It is not a de Polignac number, because 2102220220221 - 23 = 2102220220213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102220220194 and 2102220220203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102220220223) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 9816141 + ... + 10028013.
It is an arithmetic number, because the mean of its divisors is an integer number (36886415904).
Almost surely, 22102220220221 is an apocalyptic number.
It is an amenable number.
2102220220221 is a deficient number, since it is larger than the sum of its proper divisors (1438875706563).
2102220220221 is a wasteful number, since it uses less digits than its factorization.
2102220220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212035 (or 212032 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 2102220220221 its reverse (1220220222012), we get a palindrome (3322440442233).
The spelling of 2102220220221 in words is "two trillion, one hundred two billion, two hundred twenty million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •