Base | Representation |
---|---|
bin | 10110011111110010010100… |
… | …010111011010011010100011 |
3 | 110222022200221012110212200222 |
4 | 112133302110113122122203 |
5 | 100432023344040434011 |
6 | 550233010435233255 |
7 | 26561164013654012 |
oct | 2637622427323243 |
9 | 428280835425628 |
10 | 98941355796131 |
11 | 2958687aa509a2 |
12 | b11b5b7a4882b |
13 | 432918c292874 |
14 | 1a60b03ddca79 |
15 | b68a59867ddb |
hex | 59fc945da6a3 |
98941355796131 has 2 divisors, whose sum is σ = 98941355796132. Its totient is φ = 98941355796130.
The previous prime is 98941355796113. The next prime is 98941355796149. The reversal of 98941355796131 is 13169755314989.
Together with previous prime (98941355796113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (98941355796113) and next prime (98941355796149).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-98941355796131 is a prime.
It is a super-2 number, since 2×989413557961312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (98941355796931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49470677898065 + 49470677898066.
It is an arithmetic number, because the mean of its divisors is an integer number (49470677898066).
Almost surely, 298941355796131 is an apocalyptic number.
98941355796131 is a deficient number, since it is larger than the sum of its proper divisors (1).
98941355796131 is an equidigital number, since it uses as much as digits as its factorization.
98941355796131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 220449600, while the sum is 71.
The spelling of 98941355796131 in words is "ninety-eight trillion, nine hundred forty-one billion, three hundred fifty-five million, seven hundred ninety-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •