Search a number
-
+
53077035 = 3511321679
BaseRepresentation
bin1100101001111…
…0010000101011
310200212121000010
43022132100223
5102041431120
65133343003
71213101354
oct312362053
9120777003
1053077035
1127a62620
1215937a63
13acc4b3b
147098d2b
1549d67e0
hex329e42b

53077035 has 16 divisors (see below), whose sum is σ = 92643840. Its totient is φ = 25734240.

The previous prime is 53076997. The next prime is 53077061.

53077035 is nontrivially palindromic in base 10.

53077035 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 53077035 - 26 = 53076971 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 53076993 and 53077011.

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 15 ways as a sum of consecutive naturals, for example, 160675 + ... + 161004.

It is an arithmetic number, because the mean of its divisors is an integer number (5790240).

Almost surely, 253077035 is an apocalyptic number.

53077035 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

53077035 is a deficient number, since it is larger than the sum of its proper divisors (39566805).

53077035 is a wasteful number, since it uses less digits than its factorization.

53077035 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 321698.

The product of its (nonzero) digits is 11025, while the sum is 30.

The square root of 53077035 is about 7285.3987536716. The cubic root of 53077035 is about 375.8104781828.

The spelling of 53077035 in words is "fifty-three million, seventy-seven thousand, thirty-five".

Divisors: 1 3 5 11 15 33 55 165 321679 965037 1608395 3538469 4825185 10615407 17692345 53077035