Base | Representation |
---|---|
bin | 1001101110100… |
… | …0000011110101 |
3 | 2211202200010222 |
4 | 2123220003311 |
5 | 40420441110 |
6 | 4014224125 |
7 | 1003522646 |
oct | 233500365 |
9 | 84680128 |
10 | 40796405 |
11 | 21034a41 |
12 | 117b5045 |
13 | 85b51b0 |
14 | 55bd6cd |
15 | 38acc55 |
hex | 26e80f5 |
40796405 has 8 divisors (see below), whose sum is σ = 52721592. Its totient is φ = 30126528.
The previous prime is 40796383. The next prime is 40796407. The reversal of 40796405 is 50469704.
40796405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3659569 + 37136836 = 1913^2 + 6094^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40796405 - 28 = 40796149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40796407) 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 in 7 ways as a sum of consecutive naturals, for example, 313754 + ... + 313883.
It is an arithmetic number, because the mean of its divisors is an integer number (6590199).
Almost surely, 240796405 is an apocalyptic number.
It is an amenable number.
40796405 is a deficient number, since it is larger than the sum of its proper divisors (11925187).
40796405 is a wasteful number, since it uses less digits than its factorization.
40796405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627655.
The product of its (nonzero) digits is 30240, while the sum is 35.
The square root of 40796405 is about 6387.2063533285. The cubic root of 40796405 is about 344.2500126134.
The spelling of 40796405 in words is "forty million, seven hundred ninety-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •