Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001100010010101001110 |
3 | 11022211111210012021110211 |
4 | 101302030021202111032 |
5 | 130010401214202342 |
6 | 2333233552153034 |
7 | 154203215534443 |
oct | 21621411422516 |
9 | 4284453167424 |
10 | 1222122022222 |
11 | 431332025892 |
12 | 178a3223877a |
13 | 8b3267c119a |
14 | 4321858d9ca |
15 | 21bcbdbdc17 |
hex | 11c8c26254e |
1222122022222 has 4 divisors (see below), whose sum is σ = 1833183033336. Its totient is φ = 611061011110.
The previous prime is 1222122022207. The next prime is 1222122022267. The reversal of 1222122022222 is 2222202212221.
It is a semiprime because it is the product of two primes.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 1222122022193 and 1222122022202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 305530505554 + ... + 305530505557.
It is an arithmetic number, because the mean of its divisors is an integer number (458295758334).
Almost surely, 21222122022222 is an apocalyptic number.
1222122022222 is a deficient number, since it is larger than the sum of its proper divisors (611061011114).
1222122022222 is an equidigital number, since it uses as much as digits as its factorization.
1222122022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611061011113.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 1222122022222 its reverse (2222202212221), we get a palindrome (3444324234443).
The spelling of 1222122022222 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •