Base | Representation |
---|---|
bin | 1001101000100… |
… | …0111111000000 |
3 | 2211000212221200 |
4 | 2122020333000 |
5 | 40321010401 |
6 | 4002021200 |
7 | 1000311411 |
oct | 232107700 |
9 | 84025850 |
10 | 40406976 |
11 | 208993a5 |
12 | 11647800 |
13 | 84a9b6c |
14 | 551b808 |
15 | 3832686 |
hex | 2688fc0 |
40406976 has 168 divisors, whose sum is σ = 124815600. Its totient is φ = 12472320.
The previous prime is 40406959. The next prime is 40407001. The reversal of 40406976 is 67960404.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 40406976.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 684835 + ... + 684893.
It is an arithmetic number, because the mean of its divisors is an integer number (742950).
Almost surely, 240406976 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40406976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62407800).
40406976 is an abundant number, since it is smaller than the sum of its proper divisors (84408624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40406976 is a wasteful number, since it uses less digits than its factorization.
40406976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 40406976 is about 6356.6481733694. The cubic root of 40406976 is about 343.1511430607.
The spelling of 40406976 in words is "forty million, four hundred six thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •