Base | Representation |
---|---|
bin | 110101101000000010… |
… | …110011100000100000 |
3 | 12111121212012012200010 |
4 | 311220002303200200 |
5 | 1420411003444301 |
6 | 42241342124520 |
7 | 4105614055650 |
oct | 655002634040 |
9 | 174555165603 |
10 | 57580140576 |
11 | 22468540942 |
12 | b1ab580740 |
13 | 557830a0ca |
14 | 2b03344360 |
15 | 17700a75d6 |
hex | d680b3820 |
57580140576 has 48 divisors (see below), whose sum is σ = 172740423744. Its totient is φ = 16451468544.
The previous prime is 57580140517. The next prime is 57580140613. The reversal of 57580140576 is 67504108575.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×575801405762 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42841695 + ... + 42843038.
It is an arithmetic number, because the mean of its divisors is an integer number (3598758828).
Almost surely, 257580140576 is an apocalyptic number.
57580140576 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
57580140576 is an abundant number, since it is smaller than the sum of its proper divisors (115160283168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57580140576 is a wasteful number, since it uses less digits than its factorization.
57580140576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85684753 (or 85684745 counting only the distinct ones).
The product of its (nonzero) digits is 1176000, while the sum is 48.
The spelling of 57580140576 in words is "fifty-seven billion, five hundred eighty million, one hundred forty thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •