Base | Representation |
---|---|
bin | 1101100110110… |
… | …0101010011110 |
3 | 10222101100211200 |
4 | 3121230222132 |
5 | 104102140230 |
6 | 5355100330 |
7 | 1262033364 |
oct | 331545236 |
9 | 128340750 |
10 | 57068190 |
11 | 2a2391a3 |
12 | 171416a6 |
13 | ba9167a |
14 | 7817634 |
15 | 5024160 |
hex | 366ca9e |
57068190 has 24 divisors (see below), whose sum is σ = 148377528. Its totient is φ = 15218160.
The previous prime is 57068183. The next prime is 57068197. The reversal of 57068190 is 9186075.
57068190 is a `hidden beast` number, since 570 + 6 + 81 + 9 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (57068183) and next prime (57068197).
It is a super-2 number, since 2×570681902 = 6513556619752200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57068197) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 316956 + ... + 317135.
It is an arithmetic number, because the mean of its divisors is an integer number (6182397).
Almost surely, 257068190 is an apocalyptic number.
57068190 is an abundant number, since it is smaller than the sum of its proper divisors (91309338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57068190 is a wasteful number, since it uses less digits than its factorization.
57068190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634104 (or 634101 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 57068190 is about 7554.3490785110. The cubic root of 57068190 is about 385.0035193921.
The spelling of 57068190 in words is "fifty-seven million, sixty-eight thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •