Base | Representation |
---|---|
bin | 100110000110101110… |
… | …001001110110000000 |
3 | 10220121102200220002000 |
4 | 212012232021312000 |
5 | 1132243211422202 |
6 | 30443541224000 |
7 | 2645624231016 |
oct | 460656116600 |
9 | 126542626060 |
10 | 40914951552 |
11 | 16396472752 |
12 | 7b1a402000 |
13 | 3b207b2507 |
14 | 1da1cda8b6 |
15 | 10e6eb891c |
hex | 986b89d80 |
40914951552 has 256 divisors, whose sum is σ = 129052440000. Its totient is φ = 12716310528.
The previous prime is 40914951547. The next prime is 40914951601. The reversal of 40914951552 is 25515941904.
40914951552 is a `hidden beast` number, since 4 + 0 + 9 + 1 + 4 + 95 + 1 + 552 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 40914951498 and 40914951507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6400774 + ... + 6407162.
Almost surely, 240914951552 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 40914951552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64526220000).
40914951552 is an abundant number, since it is smaller than the sum of its proper divisors (88137488448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40914951552 is a wasteful number, since it uses less digits than its factorization.
40914951552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6538 (or 6520 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 45.
The spelling of 40914951552 in words is "forty billion, nine hundred fourteen million, nine hundred fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •