Base | Representation |
---|---|
bin | 1101110111111… |
… | …01101111101100 |
3 | 22002222212001101 |
4 | 12323331233230 |
5 | 214243221300 |
6 | 15314252444 |
7 | 2612144110 |
oct | 673755754 |
9 | 262885041 |
10 | 116382700 |
11 | 5a771055 |
12 | 32b87124 |
13 | 1b15b605 |
14 | 11657740 |
15 | a33db6a |
hex | 6efdbec |
116382700 has 72 divisors (see below), whose sum is σ = 294168672. Its totient is φ = 39137280.
The previous prime is 116382661. The next prime is 116382701. The reversal of 116382700 is 7283611.
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 (116382701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35532 + ... + 38668.
It is an arithmetic number, because the mean of its divisors is an integer number (4085676).
Almost surely, 2116382700 is an apocalyptic number.
116382700 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 116382700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147084336).
116382700 is an abundant number, since it is smaller than the sum of its proper divisors (177785972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116382700 is a wasteful number, since it uses less digits than its factorization.
116382700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3211 (or 3204 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 116382700 is about 10788.0813864190. The cubic root of 116382700 is about 488.2356371195.
The spelling of 116382700 in words is "one hundred sixteen million, three hundred eighty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •