Base | Representation |
---|---|
bin | 110101011101110010… |
… | …110000000100000000 |
3 | 12111011212120200200011 |
4 | 311131302300010000 |
5 | 1420032442110000 |
6 | 42212320034304 |
7 | 4101425210602 |
oct | 653562600400 |
9 | 174155520604 |
10 | 57408160000 |
11 | 2238a456334 |
12 | b161a62994 |
13 | 554b7b3459 |
14 | 2ac8577172 |
15 | 175ee352ba |
hex | d5dcb0100 |
57408160000 has 135 divisors (see below), whose sum is σ = 143433704491. Its totient is φ = 22924928000.
The previous prime is 57408159959. The next prime is 57408160001. The reversal of 57408160000 is 6180475.
The square root of 57408160000 is 239600.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 4500799744 + 52907360256 = 67088^2 + 230016^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57408160001) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 95839701 + ... + 95840299.
Almost surely, 257408160000 is an apocalyptic number.
57408160000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
57408160000 is the 239600-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57408160000
57408160000 is an abundant number, since it is smaller than the sum of its proper divisors (86025544491).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57408160000 is an frugal number, since it uses more digits than its factorization.
57408160000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1234 (or 606 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 31.
The spelling of 57408160000 in words is "fifty-seven billion, four hundred eight million, one hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •