Base | Representation |
---|---|
bin | 110111111011100101… |
… | …1111100010110011000 |
3 | 102111000202110011211011 |
4 | 1233313023330112120 |
5 | 3431441433020440 |
6 | 131102304143304 |
7 | 11451316345213 |
oct | 1576713742630 |
9 | 374022404734 |
10 | 120111220120 |
11 | 46a3671a481 |
12 | 1b341007b34 |
13 | b432258ba8 |
14 | 5b5601877a |
15 | 31ceb249ea |
hex | 1bf72fc598 |
120111220120 has 16 divisors (see below), whose sum is σ = 270250245360. Its totient is φ = 48044488032.
The previous prime is 120111220109. The next prime is 120111220157. The reversal of 120111220120 is 21022111021.
It is a self number, because there is not a number n which added to its sum of digits gives 120111220120.
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 3 ways as a sum of consecutive naturals, for example, 1501390212 + ... + 1501390291.
It is an arithmetic number, because the mean of its divisors is an integer number (16890640335).
Almost surely, 2120111220120 is an apocalyptic number.
120111220120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120111220120 is an abundant number, since it is smaller than the sum of its proper divisors (150139025240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120111220120 is a wasteful number, since it uses less digits than its factorization.
120111220120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3002780514 (or 3002780510 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120111220120 its reverse (21022111021), we get a palindrome (141133331141).
The spelling of 120111220120 in words is "one hundred twenty billion, one hundred eleven million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •