Base | Representation |
---|---|
bin | 100010000001… |
… | …110000000101 |
3 | 121210012000221 |
4 | 202001300011 |
5 | 4240420234 |
6 | 515104341 |
7 | 135551014 |
oct | 42016005 |
9 | 17705027 |
10 | 8920069 |
11 | 5042864 |
12 | 2ba20b1 |
13 | 1b04162 |
14 | 1282a7b |
15 | bb2eb4 |
hex | 881c05 |
8920069 has 2 divisors, whose sum is σ = 8920070. Its totient is φ = 8920068.
The previous prime is 8920057. The next prime is 8920097. The reversal of 8920069 is 9600298.
8920069 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6563844 + 2356225 = 2562^2 + 1535^2 .
It is a cyclic number.
It is not a de Polignac number, because 8920069 - 27 = 8919941 is a prime.
It is a super-2 number, since 2×89200692 = 159135261929522, which contains 22 as substring.
It is equal to p597481 and since 8920069 and 597481 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8920039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4460034 + 4460035.
It is an arithmetic number, because the mean of its divisors is an integer number (4460035).
Almost surely, 28920069 is an apocalyptic number.
It is an amenable number.
8920069 is a deficient number, since it is larger than the sum of its proper divisors (1).
8920069 is an equidigital number, since it uses as much as digits as its factorization.
8920069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 34.
The square root of 8920069 is about 2986.6484560457. The cubic root of 8920069 is about 207.3907607132.
The spelling of 8920069 in words is "eight million, nine hundred twenty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •