Base | Representation |
---|---|
bin | 1101110101011… |
… | …01000011000000 |
3 | 22002101001122011 |
4 | 12322231003000 |
5 | 214202132120 |
6 | 15303222304 |
7 | 2606266330 |
oct | 672550300 |
9 | 262331564 |
10 | 116052160 |
11 | 5a565784 |
12 | 32a47994 |
13 | 1b074023 |
14 | 115ad0c0 |
15 | a2c5c5a |
hex | 6ead0c0 |
116052160 has 112 divisors (see below), whose sum is σ = 319527936. Its totient is φ = 39324672.
The previous prime is 116052151. The next prime is 116052163. The reversal of 116052160 is 61250611.
It is a tau number, because it is divible by the number of its divisors (112).
It is not an unprimeable number, because it can be changed into a prime (116052163) 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, 230469 + ... + 230971.
It is an arithmetic number, because the mean of its divisors is an integer number (2852928).
Almost surely, 2116052160 is an apocalyptic number.
116052160 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 116052160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159763968).
116052160 is an abundant number, since it is smaller than the sum of its proper divisors (203475776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116052160 is a wasteful number, since it uses less digits than its factorization.
116052160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630 (or 620 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 116052160 is about 10772.7508093337. The cubic root of 116052160 is about 487.7729840806.
The spelling of 116052160 in words is "one hundred sixteen million, fifty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •