Base | Representation |
---|---|
bin | 1101110111100… |
… | …00101001101100 |
3 | 22002220010111000 |
4 | 12323300221230 |
5 | 214240012233 |
6 | 15313200300 |
7 | 2611531542 |
oct | 673605154 |
9 | 262803430 |
10 | 116329068 |
11 | 5a734829 |
12 | 32b60090 |
13 | 1b14008b |
14 | 11641d92 |
15 | a32cd13 |
hex | 6ef0a6c |
116329068 has 48 divisors (see below), whose sum is σ = 303660000. Its totient is φ = 38510784.
The previous prime is 116329049. The next prime is 116329097. The reversal of 116329068 is 860923611.
116329068 is a `hidden beast` number, since 11 + 632 + 9 + 0 + 6 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12478 + ... + 19706.
It is an arithmetic number, because the mean of its divisors is an integer number (6326250).
Almost surely, 2116329068 is an apocalyptic number.
116329068 is a gapful number since it is divisible by the number (18) 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 116329068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151830000).
116329068 is an abundant number, since it is smaller than the sum of its proper divisors (187330932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116329068 is a wasteful number, since it uses less digits than its factorization.
116329068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7391 (or 7383 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 116329068 is about 10785.5953938575. The cubic root of 116329068 is about 488.1606286146.
The spelling of 116329068 in words is "one hundred sixteen million, three hundred twenty-nine thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •