Base | Representation |
---|---|
bin | 1010000011110101110011… |
… | …11000010011101100111000 |
3 | 2220022212021011101122112122 |
4 | 11001322321320103230320 |
5 | 10344422231212320440 |
6 | 115014444243500412 |
7 | 4442163512301512 |
oct | 501727170235470 |
9 | 86285234348478 |
10 | 22122200120120 |
11 | 7059a77274831 |
12 | 2593520087708 |
13 | c461647a6699 |
14 | 566a12322bb2 |
15 | 2856b105b7b5 |
hex | 141eb9e13b38 |
22122200120120 has 32 divisors (see below), whose sum is σ = 49777357533120. Its totient is φ = 8848452090240.
The previous prime is 22122200120101. The next prime is 22122200120173. The reversal of 22122200120120 is 2102100222122.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12535616 + ... + 14191055.
It is an arithmetic number, because the mean of its divisors is an integer number (1555542422910).
Almost surely, 222122200120120 is an apocalyptic number.
22122200120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22122200120120 is an abundant number, since it is smaller than the sum of its proper divisors (27655157413000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22122200120120 is a wasteful number, since it uses less digits than its factorization.
22122200120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26747375 (or 26747371 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 22122200120120 its reverse (2102100222122), we get a palindrome (24224300342242).
The spelling of 22122200120120 in words is "twenty-two trillion, one hundred twenty-two billion, two hundred million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •