Base | Representation |
---|---|
bin | 10010010101110011010111… |
… | …10101100101111011100000 |
3 | 12021210122210012201211112210 |
4 | 21022321223311211323200 |
5 | 20241243004320324134 |
6 | 221440020444522120 |
7 | 11331600313421616 |
oct | 1112715365457340 |
9 | 167718705654483 |
10 | 40331552120544 |
11 | 1193a573804553 |
12 | 4634637250340 |
13 | 19673311cc089 |
14 | 9d60b3c556b6 |
15 | 49e1b23e72e9 |
hex | 24ae6bd65ee0 |
40331552120544 has 192 divisors, whose sum is σ = 109256955494400. Its totient is φ = 13018790400000.
The previous prime is 40331552120527. The next prime is 40331552120569. The reversal of 40331552120544 is 44502125513304.
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, 862665169 + ... + 862711919.
It is an arithmetic number, because the mean of its divisors is an integer number (569046643200).
Almost surely, 240331552120544 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 40331552120544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54628477747200).
40331552120544 is an abundant number, since it is smaller than the sum of its proper divisors (68925403373856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40331552120544 is a wasteful number, since it uses less digits than its factorization.
40331552120544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48425 (or 48417 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 39.
Adding to 40331552120544 its reverse (44502125513304), we get a palindrome (84833677633848).
The spelling of 40331552120544 in words is "forty trillion, three hundred thirty-one billion, five hundred fifty-two million, one hundred twenty thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •