Base | Representation |
---|---|
bin | 110110001110111111… |
… | …0110011100110100011 |
3 | 102010121210102201222022 |
4 | 1230131332303212203 |
5 | 3402011040324142 |
6 | 125300530332055 |
7 | 11262110122211 |
oct | 1543576634643 |
9 | 363553381868 |
10 | 116467120547 |
11 | 45436720538 |
12 | 1a6a472a02b |
13 | aca12a825b |
14 | 58cc069cb1 |
15 | 3069c516d2 |
hex | 1b1dfb39a3 |
116467120547 has 4 divisors (see below), whose sum is σ = 123318127656. Its totient is φ = 109616113440.
The previous prime is 116467120489. The next prime is 116467120591. The reversal of 116467120547 is 745021764611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 116467120547 - 210 = 116467119523 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116467120498 and 116467120507.
It is not an unprimeable number, because it can be changed into a prime (116467120597) 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, 3425503529 + ... + 3425503562.
It is an arithmetic number, because the mean of its divisors is an integer number (30829531914).
Almost surely, 2116467120547 is an apocalyptic number.
116467120547 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
116467120547 is a deficient number, since it is larger than the sum of its proper divisors (6851007109).
116467120547 is an equidigital number, since it uses as much as digits as its factorization.
116467120547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6851007108.
The product of its (nonzero) digits is 282240, while the sum is 44.
The spelling of 116467120547 in words is "one hundred sixteen billion, four hundred sixty-seven million, one hundred twenty thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •