Base | Representation |
---|---|
bin | 1001101101100… |
… | …0011111011100 |
3 | 2211122102200011 |
4 | 2123120133130 |
5 | 40411421021 |
6 | 4013013004 |
7 | 1003136020 |
oct | 233303734 |
9 | 84572604 |
10 | 40732636 |
11 | 20aa103a |
12 | 11784164 |
13 | 8592169 |
14 | 55a4380 |
15 | 3898de1 |
hex | 26d87dc |
40732636 has 48 divisors (see below), whose sum is σ = 84897792. Its totient is φ = 16732800.
The previous prime is 40732631. The next prime is 40732649. The reversal of 40732636 is 63623704.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 40732598 and 40732607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40732631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144816 + ... + 145096.
It is an arithmetic number, because the mean of its divisors is an integer number (1768704).
Almost surely, 240732636 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 40732636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42448896).
40732636 is an abundant number, since it is smaller than the sum of its proper divisors (44165156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40732636 is a wasteful number, since it uses less digits than its factorization.
40732636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490 (or 488 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 31.
The square root of 40732636 is about 6382.2124690424. The cubic root of 40732636 is about 344.0705529527.
The spelling of 40732636 in words is "forty million, seven hundred thirty-two thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •