Base | Representation |
---|---|
bin | 101110000100011000… |
… | …0111110110000111011 |
3 | 100110100200201001001002 |
4 | 1130020300332300323 |
5 | 3110102403234111 |
6 | 113240505115215 |
7 | 10101416136122 |
oct | 1341060766073 |
9 | 313320631032 |
10 | 98931305531 |
11 | 38a58163133 |
12 | 1720ba88b0b |
13 | 94382a0056 |
14 | 4b07150ab9 |
15 | 28904d963b |
hex | 1708c3ec3b |
98931305531 has 2 divisors, whose sum is σ = 98931305532. Its totient is φ = 98931305530.
The previous prime is 98931305513. The next prime is 98931305533. The reversal of 98931305531 is 13550313989.
Together with previous prime (98931305513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13550313989) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 98931305531 - 26 = 98931305467 is a prime.
It is a super-2 number, since 2×989313055312 (a number of 23 digits) contains 22 as substring.
Together with 98931305533, 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 (98931305533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49465652765 + 49465652766.
It is an arithmetic number, because the mean of its divisors is an integer number (49465652766).
Almost surely, 298931305531 is an apocalyptic number.
98931305531 is a deficient number, since it is larger than the sum of its proper divisors (1).
98931305531 is an equidigital number, since it uses as much as digits as its factorization.
98931305531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 437400, while the sum is 47.
The spelling of 98931305531 in words is "ninety-eight billion, nine hundred thirty-one million, three hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •