Base | Representation |
---|---|
bin | 1011100111100… |
… | …01000111100000 |
3 | 20210101022100000 |
4 | 11303301013200 |
5 | 144422102413 |
6 | 13400500000 |
7 | 2262240024 |
oct | 563610740 |
9 | 223338300 |
10 | 97456608 |
11 | 50014657 |
12 | 2877a600 |
13 | 17262c42 |
14 | cd2c384 |
15 | 8851073 |
hex | 5cf11e0 |
97456608 has 144 divisors (see below), whose sum is σ = 292795776. Its totient is φ = 31881600.
The previous prime is 97456607. The next prime is 97456637. The reversal of 97456608 is 80665479.
It is a tau number, because it is divible by the number of its divisors (144).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (97456603) 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 23 ways as a sum of consecutive naturals, for example, 645333 + ... + 645483.
It is an arithmetic number, because the mean of its divisors is an integer number (2033304).
Almost surely, 297456608 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 97456608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146397888).
97456608 is an abundant number, since it is smaller than the sum of its proper divisors (195339168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97456608 is a wasteful number, since it uses less digits than its factorization.
97456608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259 (or 239 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 97456608 is about 9872.0113452123. The cubic root of 97456608 is about 460.1899152797.
The spelling of 97456608 in words is "ninety-seven million, four hundred fifty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •