Base | Representation |
---|---|
bin | 1001101011011… |
… | …0100110000000 |
3 | 2211101101012210 |
4 | 2122312212000 |
5 | 40343000132 |
6 | 4010022120 |
7 | 1002020151 |
oct | 232664600 |
9 | 84341183 |
10 | 40593792 |
11 | 20a06798 |
12 | 11717940 |
13 | 8543bc5 |
14 | 5569928 |
15 | 386cbcc |
hex | 26b6980 |
40593792 has 64 divisors (see below), whose sum is σ = 109658160. Its totient is φ = 13301760.
The previous prime is 40593779. The next prime is 40593793. The reversal of 40593792 is 29739504.
It is a tau number, because it is divible by the number of its divisors (64).
It is a self number, because there is not a number n which added to its sum of digits gives 40593792.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40593793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22558 + ... + 24290.
Almost surely, 240593792 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40593792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54829080).
40593792 is an abundant number, since it is smaller than the sum of its proper divisors (69064368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40593792 is a wasteful number, since it uses less digits than its factorization.
40593792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811 (or 1799 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 39.
The square root of 40593792 is about 6371.3257647055. The cubic root of 40593792 is about 343.6791672455.
The spelling of 40593792 in words is "forty million, five hundred ninety-three thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •