Base | Representation |
---|---|
bin | 100000010101011111100… |
… | …110100000011111011111 |
3 | 21212102122002222120222000 |
4 | 200111133212200133133 |
5 | 242401331104201421 |
6 | 4420453010053343 |
7 | 316353521354226 |
oct | 40253746403737 |
9 | 7772562876860 |
10 | 2222102022111 |
11 | 78742a730364 |
12 | 2ba7a957a253 |
13 | 13170a8a652a |
14 | 7979c0abcbd |
15 | 3cc069d4226 |
hex | 2055f9a07df |
2222102022111 has 64 divisors (see below), whose sum is σ = 3418400256000. Its totient is φ = 1424918718720.
The previous prime is 2222102022097. The next prime is 2222102022149. The reversal of 2222102022111 is 1112202012222.
It is a happy number.
2222102022111 is a `hidden beast` number, since 222 + 210 + 2 + 0 + 221 + 11 = 666.
It is not a de Polignac number, because 2222102022111 - 25 = 2222102022079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222102022911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 263559066 + ... + 263567496.
It is an arithmetic number, because the mean of its divisors is an integer number (53412504000).
Almost surely, 22222102022111 is an apocalyptic number.
2222102022111 is a deficient number, since it is larger than the sum of its proper divisors (1196298233889).
2222102022111 is a wasteful number, since it uses less digits than its factorization.
2222102022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9701 (or 9695 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2222102022111 its reverse (1112202012222), we get a palindrome (3334304034333).
The spelling of 2222102022111 in words is "two trillion, two hundred twenty-two billion, one hundred two million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •