Base | Representation |
---|---|
bin | 110101011011100101… |
… | …111100010000100000 |
3 | 12111002022010100110000 |
4 | 311123211330100200 |
5 | 1414444014411043 |
6 | 42204520540000 |
7 | 4100466362451 |
oct | 653345742040 |
9 | 174068110400 |
10 | 57371247648 |
11 | 22370634560 |
12 | b151621600 |
13 | 5543c5b120 |
14 | 2ac36c9128 |
15 | 175ba932d3 |
hex | d5b97c420 |
57371247648 has 480 divisors, whose sum is σ = 204660352512. Its totient is φ = 15527116800.
The previous prime is 57371247629. The next prime is 57371247683. The reversal of 57371247648 is 84674217375.
57371247648 is a `hidden beast` number, since 573 + 7 + 1 + 2 + 4 + 7 + 64 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 57371247594 and 57371247603.
It is an unprimeable number.
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, 11487840 + ... + 11492832.
Almost surely, 257371247648 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 57371247648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102330176256).
57371247648 is an abundant number, since it is smaller than the sum of its proper divisors (147289104864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57371247648 is a wasteful number, since it uses less digits than its factorization.
57371247648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5070 (or 5053 counting only the distinct ones).
The product of its digits is 7902720, while the sum is 54.
The spelling of 57371247648 in words is "fifty-seven billion, three hundred seventy-one million, two hundred forty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •