Base | Representation |
---|---|
bin | 1010000110011101011110… |
… | …00001001011110110111101 |
3 | 2220122110121021000122102021 |
4 | 11003032233001023312331 |
5 | 10402411102311224013 |
6 | 115124052135200141 |
7 | 4451531216404030 |
oct | 503165701136675 |
9 | 86573537018367 |
10 | 22212212211133 |
11 | 70941677a3a9a |
12 | 25a8a60b16051 |
13 | c517aac701b9 |
14 | 56b110a8b017 |
15 | 287bcd4c5a8d |
hex | 1433af04bdbd |
22212212211133 has 8 divisors (see below), whose sum is σ = 25386187525952. Its totient is φ = 19038437431776.
The previous prime is 22212212211131. The next prime is 22212212211187. The reversal of 22212212211133 is 33111221221222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22212212211133 - 21 = 22212212211131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22212212211098 and 22212212211107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22212212211131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49896435 + ... + 50339632.
It is an arithmetic number, because the mean of its divisors is an integer number (3173273440744).
Almost surely, 222212212211133 is an apocalyptic number.
It is an amenable number.
22212212211133 is a deficient number, since it is larger than the sum of its proper divisors (3173975314819).
22212212211133 is a wasteful number, since it uses less digits than its factorization.
22212212211133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100267731.
The product of its digits is 1152, while the sum is 25.
Adding to 22212212211133 its reverse (33111221221222), we get a palindrome (55323433432355).
The spelling of 22212212211133 in words is "twenty-two trillion, two hundred twelve billion, two hundred twelve million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •