Base | Representation |
---|---|
bin | 11001111110001011100000… |
… | …00111111101101111011000 |
3 | 21111012212012202011122010120 |
4 | 30333011300013331233120 |
5 | 24441211000141133000 |
6 | 321244530240513240 |
7 | 15013132055653251 |
oct | 1477056007755730 |
9 | 244185182148116 |
10 | 57112061271000 |
11 | 1721a0a875199a |
12 | 64a484991b820 |
13 | 25b384b5c6188 |
14 | 101634a6abb28 |
15 | 6909383bd6a0 |
hex | 33f1701fdbd8 |
57112061271000 has 64 divisors (see below), whose sum is σ = 178189631174880. Its totient is φ = 15229883004800.
The previous prime is 57112061270993. The next prime is 57112061271007. The reversal of 57112061271000 is 17216021175.
It is an interprime number because it is at equal distance from previous prime (57112061270993) and next prime (57112061271007).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57112061271007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9518673879 + ... + 9518679878.
Almost surely, 257112061271000 is an apocalyptic number.
57112061271000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
57112061271000 is an abundant number, since it is smaller than the sum of its proper divisors (121077569903880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57112061271000 is a wasteful number, since it uses less digits than its factorization.
57112061271000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19037353781 (or 19037353767 counting only the distinct ones).
The product of its (nonzero) digits is 5880, while the sum is 33.
Adding to 57112061271000 its reverse (17216021175), we get a palindrome (57129277292175).
The spelling of 57112061271000 in words is "fifty-seven trillion, one hundred twelve billion, sixty-one million, two hundred seventy-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •