Base | Representation |
---|---|
bin | 101010011100110111… |
… | …0111010100101111011 |
3 | 22201022022002211001122 |
4 | 1110321232322211323 |
5 | 2443200201210042 |
6 | 105514001335455 |
7 | 6405046655615 |
oct | 1247156724573 |
9 | 281268084048 |
10 | 91162913147 |
11 | 357310a6a39 |
12 | 1580233758b |
13 | 879aa2cb77 |
14 | 45ab535db5 |
15 | 25884dd7d2 |
hex | 1539bba97b |
91162913147 has 2 divisors, whose sum is σ = 91162913148. Its totient is φ = 91162913146.
The previous prime is 91162913099. The next prime is 91162913161. The reversal of 91162913147 is 74131926119.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 91162913147 - 220 = 91161864571 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 91162913098 and 91162913107.
It is not a weakly prime, because it can be changed into another prime (91162913447) 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 as a sum of consecutive naturals, namely, 45581456573 + 45581456574.
It is an arithmetic number, because the mean of its divisors is an integer number (45581456574).
Almost surely, 291162913147 is an apocalyptic number.
91162913147 is a deficient number, since it is larger than the sum of its proper divisors (1).
91162913147 is an equidigital number, since it uses as much as digits as its factorization.
91162913147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 81648, while the sum is 44.
The spelling of 91162913147 in words is "ninety-one billion, one hundred sixty-two million, nine hundred thirteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •