Base | Representation |
---|---|
bin | 1001100111000… |
… | …1100011100101 |
3 | 2210212000022111 |
4 | 2121301203211 |
5 | 40304423023 |
6 | 4000001021 |
7 | 666431551 |
oct | 231614345 |
9 | 83760274 |
10 | 40311013 |
11 | 20833296 |
12 | 11600171 |
13 | 8475292 |
14 | 54d4861 |
15 | 381400d |
hex | 26718e5 |
40311013 has 2 divisors, whose sum is σ = 40311014. Its totient is φ = 40311012.
The previous prime is 40310993. The next prime is 40311023. The reversal of 40311013 is 31011304.
40311013 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., 32285124 + 8025889 = 5682^2 + 2833^2 .
It is a cyclic number.
It is not a de Polignac number, because 40311013 - 25 = 40310981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40310984 and 40311002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40311023) 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, 20155506 + 20155507.
It is an arithmetic number, because the mean of its divisors is an integer number (20155507).
Almost surely, 240311013 is an apocalyptic number.
It is an amenable number.
40311013 is a deficient number, since it is larger than the sum of its proper divisors (1).
40311013 is an equidigital number, since it uses as much as digits as its factorization.
40311013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 40311013 is about 6349.0954473846. The cubic root of 40311013 is about 342.8792765060.
Adding to 40311013 its reverse (31011304), we get a palindrome (71322317).
The spelling of 40311013 in words is "forty million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •