Base | Representation |
---|---|
bin | 1101101011010… |
… | …0011010010001 |
3 | 10222221021221221 |
4 | 3122310122101 |
5 | 104141041230 |
6 | 5405245041 |
7 | 1264366225 |
oct | 332643221 |
9 | 128837857 |
10 | 57362065 |
11 | 2a419a72 |
12 | 17263781 |
13 | bb65367 |
14 | 7892785 |
15 | 508127a |
hex | 36b4691 |
57362065 has 4 divisors (see below), whose sum is σ = 68834484. Its totient is φ = 45889648.
The previous prime is 57362051. The next prime is 57362113. The reversal of 57362065 is 56026375.
57362065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39350529 + 18011536 = 6273^2 + 4244^2 .
It is a cyclic number.
It is not a de Polignac number, because 57362065 - 25 = 57362033 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 57362065.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5736202 + ... + 5736211.
It is an arithmetic number, because the mean of its divisors is an integer number (17208621).
Almost surely, 257362065 is an apocalyptic number.
It is an amenable number.
57362065 is a deficient number, since it is larger than the sum of its proper divisors (11472419).
57362065 is a wasteful number, since it uses less digits than its factorization.
57362065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11472418.
The product of its (nonzero) digits is 37800, while the sum is 34.
The square root of 57362065 is about 7573.7748184112. The cubic root of 57362065 is about 385.6632520827.
The spelling of 57362065 in words is "fifty-seven million, three hundred sixty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •