Base | Representation |
---|---|
bin | 110101100010110100… |
… | …100110010000000000 |
3 | 12111101202100010210111 |
4 | 311202310212100000 |
5 | 1420221041431201 |
6 | 42224532241104 |
7 | 4103501305024 |
oct | 654264462000 |
9 | 174352303714 |
10 | 57492530176 |
11 | 22423041954 |
12 | b186170194 |
13 | 5563113a33 |
14 | 2ad585a384 |
15 | 176754db51 |
hex | d62d26400 |
57492530176 has 99 divisors (see below), whose sum is σ = 117837677739. Its totient is φ = 28036528128.
The previous prime is 57492530171. The next prime is 57492530177. The reversal of 57492530176 is 67103529475.
The square root of 57492530176 is 239776.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57492530171) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 452697025 + ... + 452697151.
Almost surely, 257492530176 is an apocalyptic number.
57492530176 is the 239776-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57492530176
57492530176 is an abundant number, since it is smaller than the sum of its proper divisors (60345147563).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57492530176 is an frugal number, since it uses more digits than its factorization.
57492530176 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 1587600, while the sum is 49.
Multiplying 57492530176 by its sum of digits (49), we get a square (2817133978624 = 16784322).
The spelling of 57492530176 in words is "fifty-seven billion, four hundred ninety-two million, five hundred thirty thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •