Base | Representation |
---|---|
bin | 101010100011001011… |
… | …0010001001011001011 |
3 | 22201212001100101021022 |
4 | 1111012112101023023 |
5 | 2444113341241401 |
6 | 105551001503055 |
7 | 6413226624005 |
oct | 1250626211313 |
9 | 281761311238 |
10 | 91374555851 |
11 | 3582a611267 |
12 | 158611a1a8b |
13 | 8802832637 |
14 | 45cb6a9375 |
15 | 259bd9771b |
hex | 15465912cb |
91374555851 has 2 divisors, whose sum is σ = 91374555852. Its totient is φ = 91374555850.
The previous prime is 91374555821. The next prime is 91374555863. The reversal of 91374555851 is 15855547319.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-91374555851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 91374555793 and 91374555802.
It is not a weakly prime, because it can be changed into another prime (91374555821) 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, 45687277925 + 45687277926.
It is an arithmetic number, because the mean of its divisors is an integer number (45687277926).
Almost surely, 291374555851 is an apocalyptic number.
91374555851 is a deficient number, since it is larger than the sum of its proper divisors (1).
91374555851 is an equidigital number, since it uses as much as digits as its factorization.
91374555851 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3780000, while the sum is 53.
The spelling of 91374555851 in words is "ninety-one billion, three hundred seventy-four million, five hundred fifty-five thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •