Base | Representation |
---|---|
bin | 111000110111011101… |
… | …1010010011011000000 |
3 | 102200012202112212101102 |
4 | 1301232323102123000 |
5 | 4000100222320000 |
6 | 132033505553532 |
7 | 11552151615164 |
oct | 1615673223300 |
9 | 380182485342 |
10 | 122120120000 |
11 | 4787769570a |
12 | 1b8019458a8 |
13 | b6924cb148 |
14 | 5ca6b4cca4 |
15 | 329b1943d5 |
hex | 1c6eed26c0 |
122120120000 has 140 divisors (see below), whose sum is σ = 303488415120. Its totient is φ = 48739968000.
The previous prime is 122120119997. The next prime is 122120120011. The reversal of 122120120000 is 21021221.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 19476866 + ... + 19483134.
Almost surely, 2122120120000 is an apocalyptic number.
122120120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122120120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151744207560).
122120120000 is an abundant number, since it is smaller than the sum of its proper divisors (181368295120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122120120000 is an frugal number, since it uses more digits than its factorization.
122120120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6788 (or 6763 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 122120120000 its reverse (21021221), we get a palindrome (122141141221).
The spelling of 122120120000 in words is "one hundred twenty-two billion, one hundred twenty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •