Base | Representation |
---|---|
bin | 1001101011111… |
… | …1000101111000 |
3 | 2211110010221222 |
4 | 2122333011320 |
5 | 40400103400 |
6 | 4010451212 |
7 | 1002223505 |
oct | 232770570 |
9 | 84403858 |
10 | 40628600 |
11 | 20a2a961 |
12 | 11733b08 |
13 | 85569bc |
14 | 55784ac |
15 | 3878185 |
hex | 26bf178 |
40628600 has 48 divisors (see below), whose sum is σ = 97523520. Its totient is φ = 15724800.
The previous prime is 40628597. The next prime is 40628611. The reversal of 40628600 is 682604.
It is a self number, because there is not a number n which added to its sum of digits gives 40628600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2924 + ... + 9476.
It is an arithmetic number, because the mean of its divisors is an integer number (2031740).
Almost surely, 240628600 is an apocalyptic number.
40628600 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 40628600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48761760).
40628600 is an abundant number, since it is smaller than the sum of its proper divisors (56894920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40628600 is a wasteful number, since it uses less digits than its factorization.
40628600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6600 (or 6591 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 40628600 is about 6374.0567929695. The cubic root of 40628600 is about 343.7773708233. Note that the first 3 decimals are identical.
The spelling of 40628600 in words is "forty million, six hundred twenty-eight thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •