Base | Representation |
---|---|
bin | 100100111010… |
… | …011001101101 |
3 | 200012121112002 |
4 | 210322121231 |
5 | 4434121042 |
6 | 543222045 |
7 | 145151033 |
oct | 44723155 |
9 | 20177462 |
10 | 9676397 |
11 | 550a025 |
12 | 32a7925 |
13 | 200a4a3 |
14 | 13dc553 |
15 | cb2132 |
hex | 93a66d |
9676397 has 4 divisors (see below), whose sum is σ = 9682656. Its totient is φ = 9670140.
The previous prime is 9676363. The next prime is 9676421. The reversal of 9676397 is 7936769.
9676397 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 9676397 - 28 = 9676141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9676357) 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 3 ways as a sum of consecutive naturals, for example, 1058 + ... + 4524.
It is an arithmetic number, because the mean of its divisors is an integer number (2420664).
Almost surely, 29676397 is an apocalyptic number.
It is an amenable number.
9676397 is a deficient number, since it is larger than the sum of its proper divisors (6259).
9676397 is a wasteful number, since it uses less digits than its factorization.
9676397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6258.
The product of its digits is 428652, while the sum is 47.
The square root of 9676397 is about 3110.6907593009. The cubic root of 9676397 is about 213.0940021652.
The spelling of 9676397 in words is "nine million, six hundred seventy-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •