Base | Representation |
---|---|
bin | 1010000100011110101000… |
… | …11010011110001100111000 |
3 | 2220101221211210202000122111 |
4 | 11002033110122132030320 |
5 | 10400302124222320440 |
6 | 115032511321302104 |
7 | 4443600640234165 |
oct | 502172432361470 |
9 | 86357753660574 |
10 | 22144120120120 |
11 | 70682a556a209 |
12 | 2597819034934 |
13 | c48248b9829b |
14 | 567ad15db06c |
15 | 2860456364ea |
hex | 1423d469e338 |
22144120120120 has 32 divisors (see below), whose sum is σ = 50154232338720. Its totient is φ = 8798988124800.
The previous prime is 22144120120081. The next prime is 22144120120139. The reversal of 22144120120120 is 2102102144122.
It is a junction number, because it is equal to n+sod(n) for n = 22144120120091 and 22144120120100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1833116487 + ... + 1833128566.
It is an arithmetic number, because the mean of its divisors is an integer number (1567319760585).
Almost surely, 222144120120120 is an apocalyptic number.
22144120120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22144120120120 is an abundant number, since it is smaller than the sum of its proper divisors (28010112218600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22144120120120 is a wasteful number, since it uses less digits than its factorization.
22144120120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3666245215 (or 3666245211 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 22144120120120 its reverse (2102102144122), we get a palindrome (24246222264242).
The spelling of 22144120120120 in words is "twenty-two trillion, one hundred forty-four billion, one hundred twenty million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •