Base | Representation |
---|---|
bin | 11110111000011110001… |
… | …011010000010010101110 |
3 | 21111212211011112210020200 |
4 | 132320132023100102232 |
5 | 234232301322023042 |
6 | 4302533502054330 |
7 | 306216410210244 |
oct | 36703613202256 |
9 | 7455734483220 |
10 | 2122220111022 |
11 | 749034a21200 |
12 | 2a337327a3a6 |
13 | 1251806a1bab |
14 | 74a049ca794 |
15 | 3a30cd23c4c |
hex | 1ee1e2d04ae |
2122220111022 has 36 divisors (see below), whose sum is σ = 5054157817800. Its totient is φ = 643097002680.
The previous prime is 2122220111021. The next prime is 2122220111071. The reversal of 2122220111022 is 2201110222212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2122220110986 and 2122220111004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122220111021) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 487192522 + ... + 487196877.
Almost surely, 22122220111022 is an apocalyptic number.
2122220111022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2122220111022 is an abundant number, since it is smaller than the sum of its proper divisors (2931937706778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122220111022 is a wasteful number, since it uses less digits than its factorization.
2122220111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974389429 (or 974389415 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2122220111022 its reverse (2201110222212), we get a palindrome (4323330333234).
The spelling of 2122220111022 in words is "two trillion, one hundred twenty-two billion, two hundred twenty million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •