Base | Representation |
---|---|
bin | 100101110111111011… |
… | …101000010111011000 |
3 | 10212222010210211002011 |
4 | 211313323220113120 |
5 | 1131241201414300 |
6 | 30403155115304 |
7 | 2636522214340 |
oct | 456773502730 |
9 | 125863724064 |
10 | 40666826200 |
11 | 162793aa480 |
12 | 7a6b2a2b34 |
13 | 3ab1278190 |
14 | 1d7ad8bd20 |
15 | 10d0304eba |
hex | 977ee85d8 |
40666826200 has 384 divisors, whose sum is σ = 128781757440. Its totient is φ = 11531520000.
The previous prime is 40666826173. The next prime is 40666826201. The reversal of 40666826200 is 262866604.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40666826201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 14212770 + ... + 14215630.
It is an arithmetic number, because the mean of its divisors is an integer number (335369160).
Almost surely, 240666826200 is an apocalyptic number.
40666826200 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 40666826200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64390878720).
40666826200 is an abundant number, since it is smaller than the sum of its proper divisors (88114931240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40666826200 is a wasteful number, since it uses less digits than its factorization.
40666826200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2979 (or 2970 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 40.
The spelling of 40666826200 in words is "forty billion, six hundred sixty-six million, eight hundred twenty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.414 sec. • engine limits •