Base | Representation |
---|---|
bin | 10110001011110110010100… |
… | …100111000110001001100000 |
3 | 110210110201111020120100010011 |
4 | 112023312110213012021200 |
5 | 100242101422411340000 |
6 | 543303342010014304 |
7 | 26360201625150214 |
oct | 2613662447061140 |
9 | 423421436510104 |
10 | 97571265340000 |
11 | 290a8817674701 |
12 | ab39b6b417394 |
13 | 4259c1409c35a |
14 | 1a1468dc12944 |
15 | b430bc4152ba |
hex | 58bd949c6260 |
97571265340000 has 240 divisors, whose sum is σ = 248110382575440. Its totient is φ = 37738010880000.
The previous prime is 97571265339983. The next prime is 97571265340001. The reversal of 97571265340000 is 4356217579.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97571265340001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 71302234 + ... + 72657766.
It is an arithmetic number, because the mean of its divisors is an integer number (1033793260731).
Almost surely, 297571265340000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 97571265340000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124055191287720).
97571265340000 is an abundant number, since it is smaller than the sum of its proper divisors (150539117235440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97571265340000 is a wasteful number, since it uses less digits than its factorization.
97571265340000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1355683 (or 1355660 counting only the distinct ones).
The product of its (nonzero) digits is 1587600, while the sum is 49.
The spelling of 97571265340000 in words is "ninety-seven trillion, five hundred seventy-one billion, two hundred sixty-five million, three hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •