Base | Representation |
---|---|
bin | 100000000000… |
… | …100000000001 |
3 | 120210021211002 |
4 | 200000200001 |
5 | 4122000112 |
6 | 455501345 |
7 | 131214362 |
oct | 40004001 |
9 | 16707732 |
10 | 8390657 |
11 | 4811030 |
12 | 2987855 |
13 | 197a1b2 |
14 | 1185b69 |
15 | b0b1c2 |
hex | 800801 |
8390657 has 12 divisors (see below), whose sum is σ = 9490416. Its totient is φ = 7356720.
The previous prime is 8390623. The next prime is 8390663. The reversal of 8390657 is 7560938.
8390657 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 8390657 - 26 = 8390593 is a prime.
It is an Ulam number.
It is a pancake number, because a pancake can be divided into 8390657 parts by 4096 straight cuts.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 8390657.
It is not an unprimeable number, because it can be changed into a prime (8390687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8798 + ... + 9704.
It is an arithmetic number, because the mean of its divisors is an integer number (790868).
Almost surely, 28390657 is an apocalyptic number.
It is an amenable number.
8390657 is a deficient number, since it is larger than the sum of its proper divisors (1099759).
8390657 is a wasteful number, since it uses less digits than its factorization.
8390657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 976 (or 947 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 8390657 is about 2896.6630801666. The cubic root of 8390657 is about 203.2038768067.
The spelling of 8390657 in words is "eight million, three hundred ninety thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •