Base | Representation |
---|---|
bin | 100000010101011010001… |
… | …011101101001010000110 |
3 | 21212102101202220210000121 |
4 | 200111122023231022012 |
5 | 242401134321010042 |
6 | 4420440001332154 |
7 | 316351335542344 |
oct | 40253213551206 |
9 | 7772352823017 |
10 | 2222011110022 |
11 | 787393386800 |
12 | 2ba78303705a |
13 | 1316c4ac53b2 |
14 | 7978dda4994 |
15 | 3cbeda27367 |
hex | 2055a2ed286 |
2222011110022 has 24 divisors (see below), whose sum is σ = 3664041591168. Its totient is φ = 1009873320720.
The previous prime is 2222011109993. The next prime is 2222011110023. The reversal of 2222011110022 is 2200111102222.
It is a happy number.
It is a super-2 number, since 2×22220111100222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2222011109978 and 2222011110005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222011110023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1272603 + ... + 2462425.
It is an arithmetic number, because the mean of its divisors is an integer number (152668399632).
Almost surely, 22222011110022 is an apocalyptic number.
2222011110022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2222011110022 is a deficient number, since it is larger than the sum of its proper divisors (1442030481146).
2222011110022 is a wasteful number, since it uses less digits than its factorization.
2222011110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1197564 (or 1197553 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2222011110022 its reverse (2200111102222), we get a palindrome (4422122212244).
The spelling of 2222011110022 in words is "two trillion, two hundred twenty-two billion, eleven million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •