Base | Representation |
---|---|
bin | 100101010001011101… |
… | …001110000110001110 |
3 | 10211022011011201011000 |
4 | 211101131032012032 |
5 | 1123430424220303 |
6 | 30215135441130 |
7 | 2614523415315 |
oct | 452135160616 |
9 | 124264151130 |
10 | 40021320078 |
11 | 15a77aa0143 |
12 | 790b0861a6 |
13 | 3a0a6087ac |
14 | 1d1935b27c |
15 | 10937e8da3 |
hex | 95174e18e |
40021320078 has 64 divisors (see below), whose sum is σ = 91323973440. Its totient is φ = 12983846400.
The previous prime is 40021320077. The next prime is 40021320121. The reversal of 40021320078 is 87002312004.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40021320071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 910626 + ... + 953562.
It is an arithmetic number, because the mean of its divisors is an integer number (1426937085).
Almost surely, 240021320078 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40021320078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45661986720).
40021320078 is an abundant number, since it is smaller than the sum of its proper divisors (51302653362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40021320078 is a wasteful number, since it uses less digits than its factorization.
40021320078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43410 (or 43404 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The spelling of 40021320078 in words is "forty billion, twenty-one million, three hundred twenty thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •