Base | Representation |
---|---|
bin | 10110010010100010100100… |
… | …110001010110111111100001 |
3 | 110212002200101202210001122221 |
4 | 112102202210301112333201 |
5 | 100322120142034412221 |
6 | 544254510435031041 |
7 | 26435340665036554 |
oct | 2622424461267741 |
9 | 425080352701587 |
10 | 98031097966561 |
11 | 29265834155a01 |
12 | abb310043b481 |
13 | 42913a6594c26 |
14 | 1a2ca3253a69b |
15 | b500319ee541 |
hex | 5928a4c56fe1 |
98031097966561 has 2 divisors, whose sum is σ = 98031097966562. Its totient is φ = 98031097966560.
The previous prime is 98031097966553. The next prime is 98031097966597. The reversal of 98031097966561 is 16566979013089.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92192258822400 + 5838839144161 = 9601680^2 + 2416369^2 .
It is a cyclic number.
It is not a de Polignac number, because 98031097966561 - 23 = 98031097966553 is a prime.
It is a super-2 number, since 2×980310979665612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (98031098966561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49015548983280 + 49015548983281.
It is an arithmetic number, because the mean of its divisors is an integer number (49015548983281).
Almost surely, 298031097966561 is an apocalyptic number.
It is an amenable number.
98031097966561 is a deficient number, since it is larger than the sum of its proper divisors (1).
98031097966561 is an equidigital number, since it uses as much as digits as its factorization.
98031097966561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 132269760, while the sum is 70.
The spelling of 98031097966561 in words is "ninety-eight trillion, thirty-one billion, ninety-seven million, nine hundred sixty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •