Base | Representation |
---|---|
bin | 110110000101011101… |
… | …1100111011001110111 |
3 | 102002210112001012101122 |
4 | 1230022323213121313 |
5 | 3400332231021142 |
6 | 125205112214155 |
7 | 11251146414452 |
oct | 1541273473167 |
9 | 362715035348 |
10 | 116147517047 |
11 | 45292277711 |
12 | 1a61569a35b |
13 | ac50005663 |
14 | 589b832499 |
15 | 304bb6e1d2 |
hex | 1b0aee7677 |
116147517047 has 4 divisors (see below), whose sum is σ = 122260544280. Its totient is φ = 110034489816.
The previous prime is 116147516999. The next prime is 116147517053. The reversal of 116147517047 is 740715741611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740715741611 = 31 ⋅23894056181.
It is a cyclic number.
It is not a de Polignac number, because 116147517047 - 212 = 116147512951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116147516989 and 116147517007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116147517347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3056513588 + ... + 3056513625.
It is an arithmetic number, because the mean of its divisors is an integer number (30565136070).
Almost surely, 2116147517047 is an apocalyptic number.
116147517047 is a deficient number, since it is larger than the sum of its proper divisors (6113027233).
116147517047 is an equidigital number, since it uses as much as digits as its factorization.
116147517047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6113027232.
The product of its (nonzero) digits is 164640, while the sum is 44.
The spelling of 116147517047 in words is "one hundred sixteen billion, one hundred forty-seven million, five hundred seventeen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •