Base | Representation |
---|---|
bin | 110110010011011100… |
… | …1010100010001110000 |
3 | 102011000012211222010100 |
4 | 1230212321110101300 |
5 | 3402312332121324 |
6 | 125323432032400 |
7 | 11265604252251 |
oct | 1544671242160 |
9 | 364005758110 |
10 | 116616676464 |
11 | 4550308a072 |
12 | 1a726832700 |
13 | acc627cc92 |
14 | 5903c7ab28 |
15 | 3077e444c9 |
hex | 1b26e54470 |
116616676464 has 120 divisors (see below), whose sum is σ = 328112631392. Its totient is φ = 38664552960.
The previous prime is 116616676453. The next prime is 116616676481. The reversal of 116616676464 is 464676616611.
116616676464 is a `hidden beast` number, since 1 + 16 + 6 + 166 + 7 + 6 + 464 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 116616676464.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26363757 + ... + 26368179.
Almost surely, 2116616676464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116616676464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164056315696).
116616676464 is an abundant number, since it is smaller than the sum of its proper divisors (211495954928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116616676464 is a wasteful number, since it uses less digits than its factorization.
116616676464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5375 (or 5366 counting only the distinct ones).
The product of its digits is 5225472, while the sum is 54.
The spelling of 116616676464 in words is "one hundred sixteen billion, six hundred sixteen million, six hundred seventy-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •