Base | Representation |
---|---|
bin | 1101110110110… |
… | …01011110001101 |
3 | 22002201022020121 |
4 | 12323121132031 |
5 | 214223443000 |
6 | 15311144541 |
7 | 2610655000 |
oct | 673313615 |
9 | 262638217 |
10 | 116234125 |
11 | 5a67a467 |
12 | 32b15151 |
13 | 1b108ab7 |
14 | 11619537 |
15 | a30eb1a |
hex | 6ed978d |
116234125 has 32 divisors (see below), whose sum is σ = 169228800. Its totient is φ = 79674000.
The previous prime is 116234123. The next prime is 116234143. The reversal of 116234125 is 521432611.
It is a happy number.
It is not a de Polignac number, because 116234125 - 21 = 116234123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 116234125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116234123) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 41520 + ... + 44230.
It is an arithmetic number, because the mean of its divisors is an integer number (5288400).
Almost surely, 2116234125 is an apocalyptic number.
It is an amenable number.
116234125 is a deficient number, since it is larger than the sum of its proper divisors (52994675).
116234125 is an frugal number, since it uses more digits than its factorization.
116234125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2747 (or 2723 counting only the distinct ones).
The product of its digits is 1440, while the sum is 25.
The square root of 116234125 is about 10781.1931157920. The cubic root of 116234125 is about 488.0277869267.
Adding to 116234125 its reverse (521432611), we get a palindrome (637666736).
The spelling of 116234125 in words is "one hundred sixteen million, two hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •