Base | Representation |
---|---|
bin | 10110000101100001111111… |
… | …001111111110001101100101 |
3 | 110201221012212120121010220021 |
4 | 112011201333033332031211 |
5 | 100212443303001302444 |
6 | 542332101423035141 |
7 | 26313632161311055 |
oct | 2605417717761545 |
9 | 421835776533807 |
10 | 97137115259749 |
11 | 28a5068a228594 |
12 | aa899a743bab1 |
13 | 4227cb564ac46 |
14 | 19db666385565 |
15 | b36b5c8c4584 |
hex | 58587f3fe365 |
97137115259749 has 2 divisors, whose sum is σ = 97137115259750. Its totient is φ = 97137115259748.
The previous prime is 97137115259707. The next prime is 97137115259819. The reversal of 97137115259749 is 94795251173179.
It is an a-pointer prime, because the next prime (97137115259819) can be obtained adding 97137115259749 to its sum of digits (70).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73418335402500 + 23718779857249 = 8568450^2 + 4870193^2 .
It is a cyclic number.
It is not a de Polignac number, because 97137115259749 - 27 = 97137115259621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (97137115256749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 48568557629874 + 48568557629875.
It is an arithmetic number, because the mean of its divisors is an integer number (48568557629875).
Almost surely, 297137115259749 is an apocalyptic number.
It is an amenable number.
97137115259749 is a deficient number, since it is larger than the sum of its proper divisors (1).
97137115259749 is an equidigital number, since it uses as much as digits as its factorization.
97137115259749 is an evil number, because the sum of its binary digits is even.
The product of its digits is 150028200, while the sum is 70.
The spelling of 97137115259749 in words is "ninety-seven trillion, one hundred thirty-seven billion, one hundred fifteen million, two hundred fifty-nine thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •