Base | Representation |
---|---|
bin | 10000001001010000110… |
… | …01000000101110000000 |
3 | 1222000211222101211102220 |
4 | 20010220121000232000 |
5 | 33042040434120433 |
6 | 1102501055211040 |
7 | 55035454552614 |
oct | 10045031005600 |
9 | 1860758354386 |
10 | 554728426368 |
11 | 1a429380a236 |
12 | 8b615516a80 |
13 | 404066c220c |
14 | 1cbc5921344 |
15 | e66a6882b3 |
hex | 8128640b80 |
554728426368 has 256 divisors, whose sum is σ = 1578019968000. Its totient is φ = 172053725184.
The previous prime is 554728426361. The next prime is 554728426381. The reversal of 554728426368 is 863624827455.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554728426361) 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 31 ways as a sum of consecutive naturals, for example, 216943746 + ... + 216946302.
It is an arithmetic number, because the mean of its divisors is an integer number (6164140500).
Almost surely, 2554728426368 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 554728426368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (789009984000).
554728426368 is an abundant number, since it is smaller than the sum of its proper divisors (1023291541632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
554728426368 is a wasteful number, since it uses less digits than its factorization.
554728426368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2957 (or 2945 counting only the distinct ones).
The product of its digits is 77414400, while the sum is 60.
The spelling of 554728426368 in words is "five hundred fifty-four billion, seven hundred twenty-eight million, four hundred twenty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •