Base | Representation |
---|---|
bin | 100101110010011010… |
… | …011110100010110000 |
3 | 10212201200121102020000 |
4 | 211302122132202300 |
5 | 1131044001433021 |
6 | 30350050550000 |
7 | 2634316266351 |
oct | 456232364260 |
9 | 125650542200 |
10 | 40574249136 |
11 | 16231118a03 |
12 | 7a44298300 |
13 | 3a98033255 |
14 | 1d6c96dd28 |
15 | 10c7119b26 |
hex | 97269e8b0 |
40574249136 has 400 divisors, whose sum is σ = 124801711584. Its totient is φ = 12711333888.
The previous prime is 40574249123. The next prime is 40574249137. The reversal of 40574249136 is 63194247504.
40574249136 is a `hidden beast` number, since 4 + 0 + 574 + 2 + 49 + 1 + 36 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 40574249091 and 40574249100.
It is not an unprimeable number, because it can be changed into a prime (40574249137) 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 79 ways as a sum of consecutive naturals, for example, 234533146 + ... + 234533318.
Almost surely, 240574249136 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 40574249136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62400855792).
40574249136 is an abundant number, since it is smaller than the sum of its proper divisors (84227462448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40574249136 is a wasteful number, since it uses less digits than its factorization.
40574249136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 355 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 40574249136 in words is "forty billion, five hundred seventy-four million, two hundred forty-nine thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •