Base | Representation |
---|---|
bin | 1101100111001… |
… | …0010000100111 |
3 | 10222102112021121 |
4 | 3121302100213 |
5 | 104103403421 |
6 | 5355354411 |
7 | 1262160250 |
oct | 331622047 |
9 | 128375247 |
10 | 57091111 |
11 | 2a254440 |
12 | 17152a07 |
13 | ba9bc2c |
14 | 7821b27 |
15 | 502ad41 |
hex | 3672427 |
57091111 has 32 divisors (see below), whose sum is σ = 75732480. Its totient is φ = 41731200.
The previous prime is 57091109. The next prime is 57091127. The reversal of 57091111 is 11119075.
57091111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 57091111 - 21 = 57091109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57095111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82276 + ... + 82966.
It is an arithmetic number, because the mean of its divisors is an integer number (2366640).
Almost surely, 257091111 is an apocalyptic number.
57091111 is a deficient number, since it is larger than the sum of its proper divisors (18641369).
57091111 is a wasteful number, since it uses less digits than its factorization.
57091111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775.
The product of its (nonzero) digits is 315, while the sum is 25.
The square root of 57091111 is about 7555.8659993412. The cubic root of 57091111 is about 385.0550570612.
The spelling of 57091111 in words is "fifty-seven million, ninety-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •