Base | Representation |
---|---|
bin | 110110011010000111… |
… | …0110111000101100000 |
3 | 102011120210212201100112 |
4 | 1230310032313011200 |
5 | 3403242122142442 |
6 | 125401543510452 |
7 | 11304262151600 |
oct | 1546416670540 |
9 | 364523781315 |
10 | 116840427872 |
11 | 45608414893 |
12 | 1a789758428 |
13 | b03073206c |
14 | 5925882c00 |
15 | 308c8e1082 |
hex | 1b343b7160 |
116840427872 has 72 divisors (see below), whose sum is σ = 268167548880. Its totient is φ = 49965538560.
The previous prime is 116840427871. The next prime is 116840427881. The reversal of 116840427872 is 278724048611.
It is a self number, because there is not a number n which added to its sum of digits gives 116840427872.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116840427871) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 642029 + ... + 803667.
It is an arithmetic number, because the mean of its divisors is an integer number (3724549290).
Almost surely, 2116840427872 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 116840427872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134083774440).
116840427872 is an abundant number, since it is smaller than the sum of its proper divisors (151327121008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116840427872 is a wasteful number, since it uses less digits than its factorization.
116840427872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162124 (or 162109 counting only the distinct ones).
The product of its (nonzero) digits is 1204224, while the sum is 50.
The spelling of 116840427872 in words is "one hundred sixteen billion, eight hundred forty million, four hundred twenty-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •