Base | Representation |
---|---|
bin | 1001101110101… |
… | …0100100010101 |
3 | 2211210012020102 |
4 | 2123222210111 |
5 | 40421303202 |
6 | 4014343445 |
7 | 1003564622 |
oct | 233524425 |
9 | 84705212 |
10 | 40806677 |
11 | 2104172a |
12 | 117bab85 |
13 | 85b9a82 |
14 | 55c3349 |
15 | 38b0d02 |
hex | 26ea915 |
40806677 has 2 divisors, whose sum is σ = 40806678. Its totient is φ = 40806676.
The previous prime is 40806653. The next prime is 40806691. The reversal of 40806677 is 77660804.
40806677 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., 32706961 + 8099716 = 5719^2 + 2846^2 .
It is a cyclic number.
It is not a de Polignac number, because 40806677 - 28 = 40806421 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40806677.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40806637) 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 as a sum of consecutive naturals, namely, 20403338 + 20403339.
It is an arithmetic number, because the mean of its divisors is an integer number (20403339).
Almost surely, 240806677 is an apocalyptic number.
It is an amenable number.
40806677 is a deficient number, since it is larger than the sum of its proper divisors (1).
40806677 is an equidigital number, since it uses as much as digits as its factorization.
40806677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 38.
The square root of 40806677 is about 6388.0104101355. The cubic root of 40806677 is about 344.2789027357.
The spelling of 40806677 in words is "forty million, eight hundred six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •