Base | Representation |
---|---|
bin | 101101111111001011… |
… | …0101000010011111101 |
3 | 100102220112000101022021 |
4 | 1123332112220103331 |
5 | 3104223144010121 |
6 | 113211305120141 |
7 | 10064165316301 |
oct | 1337626502375 |
9 | 312815011267 |
10 | 98756625661 |
11 | 389785a4601 |
12 | 17181489051 |
13 | 940b03c895 |
14 | 4acbc7dd01 |
15 | 287eed2641 |
hex | 16fe5a84fd |
98756625661 has 2 divisors, whose sum is σ = 98756625662. Its totient is φ = 98756625660.
The previous prime is 98756625637. The next prime is 98756625677. The reversal of 98756625661 is 16652665789.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98639336761 + 117288900 = 314069^2 + 10830^2 .
It is a cyclic number.
It is not a de Polignac number, because 98756625661 - 219 = 98756101373 is a prime.
It is a super-2 number, since 2×987566256612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 98756625661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (98756625691) 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, 49378312830 + 49378312831.
It is an arithmetic number, because the mean of its divisors is an integer number (49378312831).
Almost surely, 298756625661 is an apocalyptic number.
It is an amenable number.
98756625661 is a deficient number, since it is larger than the sum of its proper divisors (1).
98756625661 is an equidigital number, since it uses as much as digits as its factorization.
98756625661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32659200, while the sum is 61.
The spelling of 98756625661 in words is "ninety-eight billion, seven hundred fifty-six million, six hundred twenty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •