Base | Representation |
---|---|
bin | 1010000110011011011011… |
… | …11111011001001001001110 |
3 | 2220122100210020010122222120 |
4 | 11003031231333121021032 |
5 | 10402401334013102342 |
6 | 115123352003353410 |
7 | 4451462201221242 |
oct | 503155577311116 |
9 | 86570706118876 |
10 | 22211121222222 |
11 | 7093757983969 |
12 | 25a87b7682866 |
13 | c51665c25c2a |
14 | 56b049c16422 |
15 | 287b6781eaec |
hex | 14336dfd924e |
22211121222222 has 32 divisors (see below), whose sum is σ = 45863280522240. Its totient is φ = 7163618045760.
The previous prime is 22211121222203. The next prime is 22211121222259. The reversal of 22211121222222 is 22222212111222.
It is a happy number.
It is a super-2 number, since 2×222111212222222 (a number of 27 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 22211121222192 and 22211121222201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9437068 + ... + 11553375.
It is an arithmetic number, because the mean of its divisors is an integer number (1433227516320).
Almost surely, 222211121222222 is an apocalyptic number.
22211121222222 is an abundant number, since it is smaller than the sum of its proper divisors (23652159300018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22211121222222 is a wasteful number, since it uses less digits than its factorization.
22211121222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20996168.
The product of its digits is 1024, while the sum is 24.
Adding to 22211121222222 its reverse (22222212111222), we get a palindrome (44433333333444).
The spelling of 22211121222222 in words is "twenty-two trillion, two hundred eleven billion, one hundred twenty-one million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •