Base | Representation |
---|---|
bin | 111000000110111111… |
… | …1110101001000000000 |
3 | 102112000102120101102020 |
4 | 1300031333311020000 |
5 | 3433232420431033 |
6 | 131204254521440 |
7 | 11463644266434 |
oct | 1601577651000 |
9 | 375012511366 |
10 | 120493920768 |
11 | 4711274a101 |
12 | 1b429206280 |
13 | b493621390 |
14 | 5b90b989c4 |
15 | 320351c6b3 |
hex | 1c0dff5200 |
120493920768 has 160 divisors (see below), whose sum is σ = 348024600000. Its totient is φ = 36825317376.
The previous prime is 120493920749. The next prime is 120493920791. The reversal of 120493920768 is 867029394021.
It is a self number, because there is not a number n which added to its sum of digits gives 120493920768.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2954983 + ... + 2995481.
It is an arithmetic number, because the mean of its divisors is an integer number (2175153750).
Almost surely, 2120493920768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120493920768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (174012300000).
120493920768 is an abundant number, since it is smaller than the sum of its proper divisors (227530679232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120493920768 is a wasteful number, since it uses less digits than its factorization.
120493920768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40682 (or 40666 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 51.
The spelling of 120493920768 in words is "one hundred twenty billion, four hundred ninety-three million, nine hundred twenty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •