Base | Representation |
---|---|
bin | 1101110111011… |
… | …00100111100000 |
3 | 22002212021211000 |
4 | 12323230213200 |
5 | 214234000134 |
6 | 15312552000 |
7 | 2611432425 |
oct | 673544740 |
9 | 262767730 |
10 | 116312544 |
11 | 5a723377 |
12 | 32b52600 |
13 | 1b1356ba |
14 | 11639d4c |
15 | a327e99 |
hex | 6eec9e0 |
116312544 has 96 divisors (see below), whose sum is σ = 342800640. Its totient is φ = 38365056.
The previous prime is 116312519. The next prime is 116312557. The reversal of 116312544 is 445213611.
It is a happy number.
116312544 is a `hidden beast` number, since 1 + 1 + 631 + 25 + 4 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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, 88339 + ... + 89645.
It is an arithmetic number, because the mean of its divisors is an integer number (3570840).
Almost surely, 2116312544 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 116312544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171400320).
116312544 is an abundant number, since it is smaller than the sum of its proper divisors (226488096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116312544 is a wasteful number, since it uses less digits than its factorization.
116312544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429 (or 1415 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 116312544 is about 10784.8293449642. The cubic root of 116312544 is about 488.1375138754.
The spelling of 116312544 in words is "one hundred sixteen million, three hundred twelve thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •