Base | Representation |
---|---|
bin | 101101100110001000… |
… | …0110110010000000000 |
3 | 100100201221200211101000 |
4 | 1123030100312100000 |
5 | 3101013024432323 |
6 | 112552045012000 |
7 | 10034312245650 |
oct | 1331420662000 |
9 | 310657624330 |
10 | 97916249088 |
11 | 38587196209 |
12 | 16b87b54000 |
13 | 9305bc0938 |
14 | 4a4c404360 |
15 | 2831331e43 |
hex | 16cc436400 |
97916249088 has 352 divisors, whose sum is σ = 332485203200. Its totient is φ = 27885109248.
The previous prime is 97916249087. The next prime is 97916249117. The reversal of 97916249088 is 88094261979.
97916249088 is a `hidden beast` number, since 9 + 7 + 9 + 1 + 62 + 490 + 88 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (97916249087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79155606 + ... + 79156842.
Almost surely, 297916249088 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 97916249088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166242601600).
97916249088 is an abundant number, since it is smaller than the sum of its proper divisors (234568954112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97916249088 is a wasteful number, since it uses less digits than its factorization.
97916249088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1682 (or 1658 counting only the distinct ones).
The product of its (nonzero) digits is 15676416, while the sum is 63.
The spelling of 97916249088 in words is "ninety-seven billion, nine hundred sixteen million, two hundred forty-nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •