Base | Representation |
---|---|
bin | 1011101010101… |
… | …11101100010000 |
3 | 20211011122122220 |
4 | 11311113230100 |
5 | 200024024002 |
6 | 13413501040 |
7 | 2265636651 |
oct | 565275420 |
9 | 224148586 |
10 | 97876752 |
11 | 50281286 |
12 | 28941780 |
13 | 1737c24c |
14 | cddb528 |
15 | 88d57bc |
hex | 5d57b10 |
97876752 has 160 divisors (see below), whose sum is σ = 289267200. Its totient is φ = 28329984.
The previous prime is 97876747. The next prime is 97876763. The reversal of 97876752 is 25767879.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 97876695 and 97876704.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 914683 + ... + 914789.
It is an arithmetic number, because the mean of its divisors is an integer number (1807920).
Almost surely, 297876752 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 97876752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144633600).
97876752 is an abundant number, since it is smaller than the sum of its proper divisors (191390448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97876752 is a wasteful number, since it uses less digits than its factorization.
97876752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 213 (or 207 counting only the distinct ones).
The product of its digits is 1481760, while the sum is 51.
The square root of 97876752 is about 9893.2680141599. The cubic root of 97876752 is about 460.8502736189.
The spelling of 97876752 in words is "ninety-seven million, eight hundred seventy-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •