Base | Representation |
---|---|
bin | 1001100010111… |
… | …1100100000111 |
3 | 2210100021112022 |
4 | 2120233210013 |
5 | 40222300321 |
6 | 3550113355 |
7 | 664224524 |
oct | 230574407 |
9 | 83307468 |
10 | 40040711 |
11 | 206691a7 |
12 | 114ab85b |
13 | 83ac239 |
14 | 546414b |
15 | 37addab |
hex | 262f907 |
40040711 has 2 divisors, whose sum is σ = 40040712. Its totient is φ = 40040710.
The previous prime is 40040701. The next prime is 40040713. The reversal of 40040711 is 11704004.
40040711 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 is a cyclic number.
It is not a de Polignac number, because 40040711 - 26 = 40040647 is a prime.
Together with 40040713, it forms a pair of twin primes.
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 40040711.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40040713) 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, 20020355 + 20020356.
It is an arithmetic number, because the mean of its divisors is an integer number (20020356).
Almost surely, 240040711 is an apocalyptic number.
40040711 is a deficient number, since it is larger than the sum of its proper divisors (1).
40040711 is an equidigital number, since it uses as much as digits as its factorization.
40040711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 17.
The square root of 40040711 is about 6327.7729889749. The cubic root of 40040711 is about 342.1111747132. Note that the first 4 decimals are identical.
Adding to 40040711 its reverse (11704004), we get a palindrome (51744715).
The spelling of 40040711 in words is "forty million, forty thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •