Base | Representation |
---|---|
bin | 100101110011101001… |
… | …101010000000000000 |
3 | 10212210010122221112000 |
4 | 211303221222000000 |
5 | 1131114310133230 |
6 | 30352111504000 |
7 | 2634660565353 |
oct | 456351520000 |
9 | 125703587460 |
10 | 40595005440 |
11 | 16241905480 |
12 | 7a4b228000 |
13 | 3a9c41c9a2 |
14 | 1d7161429a |
15 | 10c8d69b60 |
hex | 973a6a000 |
40595005440 has 896 divisors, whose sum is σ = 163064586240. Its totient is φ = 9496166400.
The previous prime is 40595005397. The next prime is 40595005453. The reversal of 40595005440 is 4450059504.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 40595005395 and 40595005404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 571760605 + ... + 571760675.
Almost surely, 240595005440 is an apocalyptic number.
40595005440 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 40595005440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81532293120).
40595005440 is an abundant number, since it is smaller than the sum of its proper divisors (122469580800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40595005440 is a wasteful number, since it uses less digits than its factorization.
40595005440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169 (or 139 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 40595005440 in words is "forty billion, five hundred ninety-five million, five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •