Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001100001110100001110 |
3 | 11022211111210012011120121 |
4 | 101302030021201310032 |
5 | 130010401214120420 |
6 | 2333233552135154 |
7 | 154203215525335 |
oct | 21621411416416 |
9 | 4284453164517 |
10 | 1222122020110 |
11 | 431332024242 |
12 | 178a322374ba |
13 | 8b3267c0234 |
14 | 4321858cd1c |
15 | 21bcbdbd2aa |
hex | 11c8c261d0e |
1222122020110 has 16 divisors (see below), whose sum is σ = 2201142468096. Its totient is φ = 488554845408.
The previous prime is 1222122020107. The next prime is 1222122020113. The reversal of 1222122020110 is 110202212221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1222122020107) and next prime (1222122020113).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222122020113) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 36727869 + ... + 36761128.
It is an arithmetic number, because the mean of its divisors is an integer number (137571404256).
Almost surely, 21222122020110 is an apocalyptic number.
1222122020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1222122020110 is a deficient number, since it is larger than the sum of its proper divisors (979020447986).
1222122020110 is a wasteful number, since it uses less digits than its factorization.
1222122020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73490667.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1222122020110 its reverse (110202212221), we get a palindrome (1332324232331).
The spelling of 1222122020110 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •