Base | Representation |
---|---|
bin | 10100101110100000000110… |
… | …001010110111101101000111 |
3 | 102221202110211110221001110212 |
4 | 110232200012022313231013 |
5 | 43422001442241400312 |
6 | 521512414011110035 |
7 | 25125560533304054 |
oct | 2456400612675507 |
9 | 387673743831425 |
10 | 91156489403207 |
11 | 27055282906948 |
12 | a2828a3a4231b |
13 | 3bb3035116177 |
14 | 1871dd76c402b |
15 | a812c977d822 |
hex | 52e8062b7b47 |
91156489403207 has 2 divisors, whose sum is σ = 91156489403208. Its totient is φ = 91156489403206.
The previous prime is 91156489403167. The next prime is 91156489403209. The reversal of 91156489403207 is 70230498465119.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 91156489403207 - 234 = 91139309534023 is a prime.
Together with 91156489403209, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (91156489403209) 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, 45578244701603 + 45578244701604.
It is an arithmetic number, because the mean of its divisors is an integer number (45578244701604).
It is a 1-persistent number, because it is pandigital, but 2⋅91156489403207 = 182312978806414 is not.
Almost surely, 291156489403207 is an apocalyptic number.
91156489403207 is a deficient number, since it is larger than the sum of its proper divisors (1).
91156489403207 is an equidigital number, since it uses as much as digits as its factorization.
91156489403207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 91156489403207 in words is "ninety-one trillion, one hundred fifty-six billion, four hundred eighty-nine million, four hundred three thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •