Base | Representation |
---|---|
bin | 1101111010011… |
… | …11001000000000 |
3 | 22010121210022000 |
4 | 12331033020000 |
5 | 214334403112 |
6 | 15325344000 |
7 | 2615032656 |
oct | 675171000 |
9 | 263553260 |
10 | 116716032 |
11 | 5a979534 |
12 | 33108000 |
13 | 1b247254 |
14 | 11702dd6 |
15 | a3a77dc |
hex | 6f4f200 |
116716032 has 80 divisors (see below), whose sum is σ = 345528480. Its totient is φ = 38900736.
The previous prime is 116716027. The next prime is 116716049. The reversal of 116716032 is 230617611.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 116715987 and 116716005.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9603 + ... + 18045.
It is an arithmetic number, because the mean of its divisors is an integer number (4319106).
Almost surely, 2116716032 is an apocalyptic number.
116716032 is a gapful number since it is divisible by the number (12) 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 116716032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172764240).
116716032 is an abundant number, since it is smaller than the sum of its proper divisors (228812448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116716032 is an frugal number, since it uses more digits than its factorization.
116716032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8470 (or 8448 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 116716032 is about 10803.5194265573. The cubic root of 116716032 is about 488.7013118167.
The spelling of 116716032 in words is "one hundred sixteen million, seven hundred sixteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •