Base | Representation |
---|---|
bin | 1001110000100… |
… | …1010111001011 |
3 | 2212000121021001 |
4 | 2130021113023 |
5 | 40434322221 |
6 | 4021155431 |
7 | 1004631433 |
oct | 234112713 |
9 | 85017231 |
10 | 40932811 |
11 | 21118477 |
12 | 1185bb77 |
13 | 86322ca |
14 | 56172c3 |
15 | 38d8391 |
hex | 27095cb |
40932811 has 2 divisors, whose sum is σ = 40932812. Its totient is φ = 40932810.
The previous prime is 40932809. The next prime is 40932839. The reversal of 40932811 is 11823904.
It is a happy number.
40932811 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (40932839) can be obtained adding 40932811 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40932811 - 21 = 40932809 is a prime.
Together with 40932809, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 40932811.
It is not a weakly prime, because it can be changed into another prime (40932851) 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, 20466405 + 20466406.
It is an arithmetic number, because the mean of its divisors is an integer number (20466406).
Almost surely, 240932811 is an apocalyptic number.
40932811 is a deficient number, since it is larger than the sum of its proper divisors (1).
40932811 is an equidigital number, since it uses as much as digits as its factorization.
40932811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 40932811 is about 6397.8755067600. The cubic root of 40932811 is about 344.6332614851.
The spelling of 40932811 in words is "forty million, nine hundred thirty-two thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •