Base | Representation |
---|---|
bin | 101010011011001000… |
… | …1110001001000011011 |
3 | 22201011021000111122012 |
4 | 1110312101301020123 |
5 | 2443040331044241 |
6 | 105504131020135 |
7 | 6403444134431 |
oct | 1246621611033 |
9 | 281137014565 |
10 | 91104940571 |
11 | 35701400317 |
12 | 157a6a3a64b |
13 | 878ba12978 |
14 | 45a3964d51 |
15 | 258338b6eb |
hex | 153647121b |
91104940571 has 2 divisors, whose sum is σ = 91104940572. Its totient is φ = 91104940570.
The previous prime is 91104940501. The next prime is 91104940573. The reversal of 91104940571 is 17504940119.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-91104940571 is a prime.
It is a super-3 number, since 3×911049405713 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 91104940573, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (91104940573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45552470285 + 45552470286.
It is an arithmetic number, because the mean of its divisors is an integer number (45552470286).
Almost surely, 291104940571 is an apocalyptic number.
91104940571 is a deficient number, since it is larger than the sum of its proper divisors (1).
91104940571 is an equidigital number, since it uses as much as digits as its factorization.
91104940571 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 41.
The spelling of 91104940571 in words is "ninety-one billion, one hundred four million, nine hundred forty thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •