Base | Representation |
---|---|
bin | 10000001110001011101… |
… | …11011001011100000000 |
3 | 1222021200002202202022002 |
4 | 20013011313121130000 |
5 | 33112443311233343 |
6 | 1104015154203132 |
7 | 55161105233132 |
oct | 10070567313400 |
9 | 1867602682262 |
10 | 557370414848 |
11 | 1a541a083295 |
12 | 900322834a8 |
13 | 40737b76b00 |
14 | 1cd96773052 |
15 | e7725ae8b8 |
hex | 81c5dd9700 |
557370414848 has 324 divisors, whose sum is σ = 1286044639488. Its totient is φ = 240929095680.
The previous prime is 557370414841. The next prime is 557370414863. The reversal of 557370414848 is 848414073755.
It is a junction number, because it is equal to n+sod(n) for n = 557370414793 and 557370414802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (557370414841) 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 35 ways as a sum of consecutive naturals, for example, 1983524468 + ... + 1983524748.
Almost surely, 2557370414848 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 557370414848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (643022319744).
557370414848 is an abundant number, since it is smaller than the sum of its proper divisors (728674224640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
557370414848 is a wasteful number, since it uses less digits than its factorization.
557370414848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488 (or 442 counting only the distinct ones).
The product of its (nonzero) digits is 15052800, while the sum is 56.
The spelling of 557370414848 in words is "five hundred fifty-seven billion, three hundred seventy million, four hundred fourteen thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •