Base | Representation |
---|---|
bin | 101010101101010011… |
… | …1101111100001100011 |
3 | 22202201202100112011111 |
4 | 1111122213233201203 |
5 | 3000312424242211 |
6 | 110044431524151 |
7 | 6424526632216 |
oct | 1253247574143 |
9 | 282652315144 |
10 | 91714680931 |
11 | 35994601275 |
12 | 15937089657 |
13 | 885813bb93 |
14 | 462092577d |
15 | 25bbb80421 |
hex | 155a9ef863 |
91714680931 has 2 divisors, whose sum is σ = 91714680932. Its totient is φ = 91714680930.
The previous prime is 91714680913. The next prime is 91714681033. The reversal of 91714680931 is 13908641719.
Together with previous prime (91714680913) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 91714680931 - 27 = 91714680803 is a prime.
It is a super-2 number, since 2×917146809312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (91714680731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45857340465 + 45857340466.
It is an arithmetic number, because the mean of its divisors is an integer number (45857340466).
Almost surely, 291714680931 is an apocalyptic number.
91714680931 is a deficient number, since it is larger than the sum of its proper divisors (1).
91714680931 is an equidigital number, since it uses as much as digits as its factorization.
91714680931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 49.
The spelling of 91714680931 in words is "ninety-one billion, seven hundred fourteen million, six hundred eighty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •