Base | Representation |
---|---|
bin | 1011100110110… |
… | …11000100100100 |
3 | 20210012201110120 |
4 | 11303123010210 |
5 | 144411210213 |
6 | 13354521540 |
7 | 2261412534 |
oct | 563330444 |
9 | 223181416 |
10 | 97366308 |
11 | 4aa62826 |
12 | 287362b0 |
13 | 17230b00 |
14 | cd074c4 |
15 | 8834423 |
hex | 5cdb124 |
97366308 has 72 divisors (see below), whose sum is σ = 252223776. Its totient is φ = 29203200.
The previous prime is 97366301. The next prime is 97366333. The reversal of 97366308 is 80366379.
It is a self number, because there is not a number n which added to its sum of digits gives 97366308.
It is not an unprimeable number, because it can be changed into a prime (97366301) 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, 82563 + ... + 83733.
It is an arithmetic number, because the mean of its divisors is an integer number (3503108).
Almost surely, 297366308 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 97366308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126111888).
97366308 is an abundant number, since it is smaller than the sum of its proper divisors (154857468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97366308 is a wasteful number, since it uses less digits than its factorization.
97366308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245 (or 1230 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 42.
The square root of 97366308 is about 9867.4367492272. The cubic root of 97366308 is about 460.0477392168.
The spelling of 97366308 in words is "ninety-seven million, three hundred sixty-six thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •