Base | Representation |
---|---|
bin | 11010000010110011101001… |
… | …11111000010000110110000 |
3 | 21111210001121101221111022110 |
4 | 31001121310333002012300 |
5 | 30001312110442334431 |
6 | 321445543222405320 |
7 | 15030461113005000 |
oct | 1501316477020660 |
9 | 244701541844273 |
10 | 57271056605616 |
11 | 17280578445087 |
12 | 650b620b90840 |
13 | 25c5839681229 |
14 | 101dd109bc000 |
15 | 694b41a57346 |
hex | 341674fc21b0 |
57271056605616 has 160 divisors (see below), whose sum is σ = 172600488576000. Its totient is φ = 16357110443520.
The previous prime is 57271056605591. The next prime is 57271056605657. The reversal of 57271056605616 is 61650665017275.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43992340 + ... + 45275468.
It is an arithmetic number, because the mean of its divisors is an integer number (1078753053600).
Almost surely, 257271056605616 is an apocalyptic number.
57271056605616 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57271056605616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86300244288000).
57271056605616 is an abundant number, since it is smaller than the sum of its proper divisors (115329431970384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57271056605616 is a wasteful number, since it uses less digits than its factorization.
57271056605616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285872 (or 1285852 counting only the distinct ones).
The product of its (nonzero) digits is 15876000, while the sum is 57.
The spelling of 57271056605616 in words is "fifty-seven trillion, two hundred seventy-one billion, fifty-six million, six hundred five thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •