Base | Representation |
---|---|
bin | 1001101011111… |
… | …1111011000000 |
3 | 2211110022121220 |
4 | 2122333323000 |
5 | 40400211000 |
6 | 4010515040 |
7 | 1002236433 |
oct | 232777300 |
9 | 84408556 |
10 | 40632000 |
11 | 20a32472 |
12 | 11735a80 |
13 | 8558406 |
14 | 557981a |
15 | 38791a0 |
hex | 26bfec0 |
40632000 has 112 divisors (see below), whose sum is σ = 134246112. Its totient is φ = 10828800.
The previous prime is 40631993. The next prime is 40632001. The reversal of 40632000 is 23604.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (40632001) 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, 23154 + ... + 24846.
It is an arithmetic number, because the mean of its divisors is an integer number (1198626).
Almost surely, 240632000 is an apocalyptic number.
40632000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40632000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67123056).
40632000 is an abundant number, since it is smaller than the sum of its proper divisors (93614112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40632000 is a wasteful number, since it uses less digits than its factorization.
40632000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1723 (or 1703 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 40632000 is about 6374.3234935168. The cubic root of 40632000 is about 343.7869602132.
Adding to 40632000 its reverse (23604), we get a palindrome (40655604).
The spelling of 40632000 in words is "forty million, six hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •