Base | Representation |
---|---|
bin | 110101001001101110… |
… | …011100111110110110 |
3 | 12110022102002000211000 |
4 | 311021232130332312 |
5 | 1413340300121300 |
6 | 42115052024130 |
7 | 4060166436420 |
oct | 651156347666 |
9 | 173272060730 |
10 | 57071488950 |
11 | 222274053a3 |
12 | b089162046 |
13 | 54c6b16108 |
14 | 2a95979810 |
15 | 17405d0c00 |
hex | d49b9cfb6 |
57071488950 has 192 divisors, whose sum is σ = 180453450240. Its totient is φ = 12992400000.
The previous prime is 57071488927. The next prime is 57071488967. The reversal of 57071488950 is 5988417075.
57071488950 is a `hidden beast` number, since 5 + 7 + 0 + 71 + 488 + 95 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2359920 + ... + 2383980.
It is an arithmetic number, because the mean of its divisors is an integer number (939861720).
Almost surely, 257071488950 is an apocalyptic number.
57071488950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 57071488950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90226725120).
57071488950 is an abundant number, since it is smaller than the sum of its proper divisors (123381961290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57071488950 is a wasteful number, since it uses less digits than its factorization.
57071488950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24340 (or 24329 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 54.
The spelling of 57071488950 in words is "fifty-seven billion, seventy-one million, four hundred eighty-eight thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •