Base | Representation |
---|---|
bin | 110110000110101001… |
… | …0110010101100110011 |
3 | 102002220021121121112212 |
4 | 1230031102302230303 |
5 | 3400422402201214 |
6 | 125213045442335 |
7 | 11252140312034 |
oct | 1541522625463 |
9 | 362807547485 |
10 | 116187147059 |
11 | 45302685295 |
12 | 1a626a103ab |
13 | ac5829c979 |
14 | 58a2bcaa8b |
15 | 305039b53e |
hex | 1b0d4b2b33 |
116187147059 has 4 divisors (see below), whose sum is σ = 116318730216. Its totient is φ = 116055563904.
The previous prime is 116187147017. The next prime is 116187147091. The reversal of 116187147059 is 950741781611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 950741781611 = 65413 ⋅14534447.
It is a cyclic number.
It is not a de Polignac number, because 116187147059 - 212 = 116187142963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116187146998 and 116187147016.
It is not an unprimeable number, because it can be changed into a prime (116187147859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65790254 + ... + 65792019.
It is an arithmetic number, because the mean of its divisors is an integer number (29079682554).
Almost surely, 2116187147059 is an apocalyptic number.
116187147059 is a deficient number, since it is larger than the sum of its proper divisors (131583157).
116187147059 is an equidigital number, since it uses as much as digits as its factorization.
116187147059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131583156.
The product of its (nonzero) digits is 423360, while the sum is 50.
The spelling of 116187147059 in words is "one hundred sixteen billion, one hundred eighty-seven million, one hundred forty-seven thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •