Base | Representation |
---|---|
bin | 100100111111… |
… | …100101001000 |
3 | 200020200121200 |
4 | 210333211020 |
5 | 4440310413 |
6 | 543504200 |
7 | 145266624 |
oct | 44774510 |
9 | 20220550 |
10 | 9697608 |
11 | 5523a58 |
12 | 32b8060 |
13 | 201703b |
14 | 1406184 |
15 | cb8573 |
hex | 93f948 |
9697608 has 36 divisors (see below), whose sum is σ = 26336115. Its totient is φ = 3223728.
The previous prime is 9697603. The next prime is 9697691. The reversal of 9697608 is 8067969.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
9697608 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 4848804 + 4848804 = 2202^2 + 2202^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=2202.
It is not an unprimeable number, because it can be changed into a prime (9697603) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 26241 + ... + 26607.
Almost surely, 29697608 is an apocalyptic number.
It is an amenable number.
9697608 is an abundant number, since it is smaller than the sum of its proper divisors (16638507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9697608 is a wasteful number, since it uses less digits than its factorization.
9697608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 746 (or 372 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 45.
The square root of 9697608 is about 3114.0982643456. The cubic root of 9697608 is about 213.2495916984.
The spelling of 9697608 in words is "nine million, six hundred ninety-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •