Base | Representation |
---|---|
bin | 1101110101010… |
… | …01100000010000 |
3 | 22002100022201200 |
4 | 12322221200100 |
5 | 214201201043 |
6 | 15303031200 |
7 | 2606206116 |
oct | 672514020 |
9 | 262308650 |
10 | 116037648 |
11 | 5a555891 |
12 | 32a3b500 |
13 | 1b06a53c |
14 | 115a7ab6 |
15 | a2c17d3 |
hex | 6ea9810 |
116037648 has 120 divisors (see below), whose sum is σ = 347843808. Its totient is φ = 35982336.
The previous prime is 116037629. The next prime is 116037653. The reversal of 116037648 is 846730611.
116037648 is a `hidden beast` number, since 1 + 1 + 6 + 0 + 3 + 7 + 648 = 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 pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 261715 + ... + 262157.
Almost surely, 2116037648 is an apocalyptic number.
116037648 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 116037648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173921904).
116037648 is an abundant number, since it is smaller than the sum of its proper divisors (231806160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116037648 is a wasteful number, since it uses less digits than its factorization.
116037648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581 (or 572 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 116037648 is about 10772.0772370049. The cubic root of 116037648 is about 487.7526516812.
The spelling of 116037648 in words is "one hundred sixteen million, thirty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •