Base | Representation |
---|---|
bin | 1101110101110… |
… | …00101000110000 |
3 | 22002110110202101 |
4 | 12322320220300 |
5 | 214210142012 |
6 | 15304230144 |
7 | 2606554615 |
oct | 672705060 |
9 | 262413671 |
10 | 116099632 |
11 | 5a598410 |
12 | 32a6b354 |
13 | 1b08c80c |
14 | 115c250c |
15 | a2d4d57 |
hex | 6eb8a30 |
116099632 has 20 divisors (see below), whose sum is σ = 245392776. Its totient is φ = 52772480.
The previous prime is 116099617. The next prime is 116099651. The reversal of 116099632 is 236990611.
It is a junction number, because it is equal to n+sod(n) for n = 116099591 and 116099600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329653 + ... + 330004.
Almost surely, 2116099632 is an apocalyptic number.
It is an amenable number.
116099632 is an abundant number, since it is smaller than the sum of its proper divisors (129293144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116099632 is a wasteful number, since it uses less digits than its factorization.
116099632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659676 (or 659670 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 37.
The square root of 116099632 is about 10774.9539210152. The cubic root of 116099632 is about 487.8394840708.
The spelling of 116099632 in words is "one hundred sixteen million, ninety-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •