Base | Representation |
---|---|
bin | 110111111000100111… |
… | …0000011011011101000 |
3 | 102110202210002001201101 |
4 | 1233301032003123220 |
5 | 3431240321010440 |
6 | 131044330331144 |
7 | 11445662414266 |
oct | 1576116033350 |
9 | 373683061641 |
10 | 120011110120 |
11 | 46995163340 |
12 | 1b313589ab4 |
13 | b4175a72c5 |
14 | 5b469d9436 |
15 | 31c5e4c69a |
hex | 1bf13836e8 |
120011110120 has 64 divisors (see below), whose sum is σ = 297325857600. Its totient is φ = 43232532480.
The previous prime is 120011110103. The next prime is 120011110151. The reversal of 120011110120 is 21011110021.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 120011110097 and 120011110106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1227465 + ... + 1321624.
It is an arithmetic number, because the mean of its divisors is an integer number (4645716525).
Almost surely, 2120011110120 is an apocalyptic number.
120011110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120011110120 is an abundant number, since it is smaller than the sum of its proper divisors (177314747480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120011110120 is a wasteful number, since it uses less digits than its factorization.
120011110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2549218 (or 2549214 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 120011110120 its reverse (21011110021), we get a palindrome (141022220141).
Subtracting from 120011110120 its reverse (21011110021), we obtain a palindrome (99000000099).
The spelling of 120011110120 in words is "one hundred twenty billion, eleven million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •