Base | Representation |
---|---|
bin | 110110000100111101… |
… | …1001000101100001001 |
3 | 102002202100020102210210 |
4 | 1230021323020230021 |
5 | 3400313414122100 |
6 | 125203310031333 |
7 | 11250552634506 |
oct | 1541173105411 |
9 | 362670212723 |
10 | 116130614025 |
11 | 45283782178 |
12 | 1a60baa8549 |
13 | ac49667a7a |
14 | 58994b24ad |
15 | 304a430c50 |
hex | 1b09ec8b09 |
116130614025 has 24 divisors (see below), whose sum is σ = 193982035744. Its totient is φ = 61297804800.
The previous prime is 116130614023. The next prime is 116130614029. The reversal of 116130614025 is 520416031611.
It is a happy number.
It is not a de Polignac number, because 116130614025 - 21 = 116130614023 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 116130613983 and 116130614001.
It is not an unprimeable number, because it can be changed into a prime (116130614023) 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 23 ways as a sum of consecutive naturals, for example, 7974211 + ... + 7988760.
Almost surely, 2116130614025 is an apocalyptic number.
116130614025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116130614025 is a deficient number, since it is larger than the sum of its proper divisors (77851421719).
116130614025 is a wasteful number, since it uses less digits than its factorization.
116130614025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15963081 (or 15963076 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 116130614025 its reverse (520416031611), we get a palindrome (636546645636).
The spelling of 116130614025 in words is "one hundred sixteen billion, one hundred thirty million, six hundred fourteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •