Base | Representation |
---|---|
bin | 101001001110… |
… | …010101110001 |
3 | 202100000220222 |
4 | 221032111301 |
5 | 10231303031 |
6 | 1023342425 |
7 | 160566146 |
oct | 51162561 |
9 | 22300828 |
10 | 10806641 |
11 | 611120a |
12 | 3751a15 |
13 | 2314a81 |
14 | 16143cd |
15 | e36e7b |
hex | a4e571 |
10806641 has 2 divisors, whose sum is σ = 10806642. Its totient is φ = 10806640.
The previous prime is 10806637. The next prime is 10806643. The reversal of 10806641 is 14660801.
10806641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5424241 + 5382400 = 2329^2 + 2320^2 .
It is a cyclic number.
It is not a de Polignac number, because 10806641 - 22 = 10806637 is a prime.
Together with 10806643, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p714572 and since 10806641 and 714572 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10806641.
It is not a weakly prime, because it can be changed into another prime (10806643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5403320 + 5403321.
It is an arithmetic number, because the mean of its divisors is an integer number (5403321).
Almost surely, 210806641 is an apocalyptic number.
It is an amenable number.
10806641 is a deficient number, since it is larger than the sum of its proper divisors (1).
10806641 is an equidigital number, since it uses as much as digits as its factorization.
10806641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 10806641 is about 3287.3455857272. The cubic root of 10806641 is about 221.0871874003.
The spelling of 10806641 in words is "ten million, eight hundred six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •