Base | Representation |
---|---|
bin | 110111111000101110… |
… | …1101011011011101000 |
3 | 102110210001210011101002 |
4 | 1233301131223123220 |
5 | 3431242343043440 |
6 | 131044554214132 |
7 | 11446042264055 |
oct | 1576135533350 |
9 | 373701704332 |
10 | 120015206120 |
11 | 46997500767 |
12 | 1b314a24348 |
13 | b4183ac784 |
14 | 5b4738402c |
15 | 31c64ab115 |
hex | 1bf176b6e8 |
120015206120 has 64 divisors (see below), whose sum is σ = 281833585920. Its totient is φ = 45909287424.
The previous prime is 120015206117. The next prime is 120015206131. The reversal of 120015206120 is 21602510021.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 120015206092 and 120015206101.
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 15 ways as a sum of consecutive naturals, for example, 5709149 + ... + 5730131.
It is an arithmetic number, because the mean of its divisors is an integer number (4403649780).
Almost surely, 2120015206120 is an apocalyptic number.
120015206120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120015206120 is an abundant number, since it is smaller than the sum of its proper divisors (161818379800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120015206120 is a wasteful number, since it uses less digits than its factorization.
120015206120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27234 (or 27230 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 120015206120 its reverse (21602510021), we get a palindrome (141617716141).
The spelling of 120015206120 in words is "one hundred twenty billion, fifteen million, two hundred six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •