Base | Representation |
---|---|
bin | 1101100111111… |
… | …1111100001110 |
3 | 10222112101011010 |
4 | 3121333330032 |
5 | 104112202100 |
6 | 5400510050 |
7 | 1262512524 |
oct | 331777416 |
9 | 128471133 |
10 | 57147150 |
11 | 2a292555 |
12 | 1717b326 |
13 | babb5a8 |
14 | 7838314 |
15 | 503c750 |
hex | 367ff0e |
57147150 has 48 divisors (see below), whose sum is σ = 142276608. Its totient is φ = 15180000.
The previous prime is 57147133. The next prime is 57147169. The reversal of 57147150 is 5174175.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49075 + ... + 50225.
It is an arithmetic number, because the mean of its divisors is an integer number (2964096).
Almost surely, 257147150 is an apocalyptic number.
57147150 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 57147150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71138304).
57147150 is an abundant number, since it is smaller than the sum of its proper divisors (85129458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57147150 is a wasteful number, since it uses less digits than its factorization.
57147150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1497 (or 1492 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 30.
The square root of 57147150 is about 7559.5734006622. The cubic root of 57147150 is about 385.1810022020.
The spelling of 57147150 in words is "fifty-seven million, one hundred forty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •