Base | Representation |
---|---|
bin | 10110000101100001111111… |
… | …001111111110001100111101 |
3 | 110201221012212120121010211210 |
4 | 112011201333033332030331 |
5 | 100212443303001302314 |
6 | 542332101423035033 |
7 | 26313632161311000 |
oct | 2605417717761475 |
9 | 421835776533753 |
10 | 97137115259709 |
11 | 28a5068a228558 |
12 | aa899a743ba79 |
13 | 4227cb564ac15 |
14 | 19db666385537 |
15 | b36b5c8c4559 |
hex | 58587f3fe33d |
97137115259709 has 128 divisors (see below), whose sum is σ = 162828864000000. Its totient is φ = 51328530489600.
The previous prime is 97137115259707. The next prime is 97137115259749. The reversal of 97137115259709 is 90795251173179.
It is not a de Polignac number, because 97137115259709 - 21 = 97137115259707 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 97137115259709.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97137115259707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 155921167 + ... + 156542915.
It is an arithmetic number, because the mean of its divisors is an integer number (1272100500000).
Almost surely, 297137115259709 is an apocalyptic number.
It is an amenable number.
97137115259709 is a deficient number, since it is larger than the sum of its proper divisors (65691748740291).
97137115259709 is a wasteful number, since it uses less digits than its factorization.
97137115259709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621984 (or 621970 counting only the distinct ones).
The product of its (nonzero) digits is 37507050, while the sum is 66.
The spelling of 97137115259709 in words is "ninety-seven trillion, one hundred thirty-seven billion, one hundred fifteen million, two hundred fifty-nine thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •