Base | Representation |
---|---|
bin | 1101110110001… |
… | …10101011101000 |
3 | 22002120101200001 |
4 | 12323012223220 |
5 | 214214012120 |
6 | 15305352344 |
7 | 2610214420 |
oct | 673065350 |
9 | 262511601 |
10 | 116157160 |
11 | 5a627659 |
12 | 32a986b4 |
13 | 1b0aca62 |
14 | 115d9480 |
15 | a2e6e0a |
hex | 6ec6ae8 |
116157160 has 64 divisors (see below), whose sum is σ = 299819520. Its totient is φ = 39674880.
The previous prime is 116157149. The next prime is 116157161. The reversal of 116157160 is 61751611.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (116157161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93745 + ... + 94975.
It is an arithmetic number, because the mean of its divisors is an integer number (4684680).
Almost surely, 2116157160 is an apocalyptic number.
116157160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116157160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149909760).
116157160 is an abundant number, since it is smaller than the sum of its proper divisors (183662360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116157160 is a wasteful number, since it uses less digits than its factorization.
116157160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586 (or 1582 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 28.
The square root of 116157160 is about 10777.6231145833. The cubic root of 116157160 is about 487.9200464730.
The spelling of 116157160 in words is "one hundred sixteen million, one hundred fifty-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •