Base | Representation |
---|---|
bin | 11010000010011000110000… |
… | …10100000100010000010000 |
3 | 21111201200100002011022001021 |
4 | 31001030120110010100100 |
5 | 30001043022413431324 |
6 | 321435154322245224 |
7 | 15026440225565131 |
oct | 1501143024042020 |
9 | 244650302138037 |
10 | 57256616936464 |
11 | 17275438646a10 |
12 | 65088711b6814 |
13 | 25c4377c519ba |
14 | 101d340d75c88 |
15 | 694599026ae4 |
hex | 341318504410 |
57256616936464 has 20 divisors (see below), whose sum is σ = 121019667616080. Its totient is φ = 26025734971040.
The previous prime is 57256616936437. The next prime is 57256616936509. The reversal of 57256616936464 is 46463961665275.
It is a super-2 number, since 2×572566169364642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 57256616936393 and 57256616936402.
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 3 ways as a sum of consecutive naturals, for example, 162660843394 + ... + 162660843745.
It is an arithmetic number, because the mean of its divisors is an integer number (6050983380804).
Almost surely, 257256616936464 is an apocalyptic number.
It is an amenable number.
57256616936464 is an abundant number, since it is smaller than the sum of its proper divisors (63763050679616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57256616936464 is a wasteful number, since it uses less digits than its factorization.
57256616936464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325321687158 (or 325321687152 counting only the distinct ones).
The product of its digits is 1175731200, while the sum is 70.
The spelling of 57256616936464 in words is "fifty-seven trillion, two hundred fifty-six billion, six hundred sixteen million, nine hundred thirty-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •