Search a number
-
+
53026505 = 579715619
BaseRepresentation
bin1100101001000…
…1111011001001
310200210000200122
43022101323021
5102033322010
65132313025
71212501140
oct312217311
9120700618
1053026505
1127a28664
1215912775
13aca7b3c
147084757
1549c6855
hex3291ec9

53026505 has 16 divisors (see below), whose sum is σ = 73476480. Its totient is φ = 35983872.

The previous prime is 53026499. The next prime is 53026517. The reversal of 53026505 is 50562035.

53026505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is not a de Polignac number, because 53026505 - 28 = 53026249 is a prime.

It is a Curzon number.

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, 4415 + ... + 11204.

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

Almost surely, 253026505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15728.

The product of its (nonzero) digits is 4500, while the sum is 26.

The square root of 53026505 is about 7281.9300326218. The cubic root of 53026505 is about 375.6911815617.

It can be divided in two parts, 530 and 26505, that multiplied together give a triangular number (14047650 = T5300).

The spelling of 53026505 in words is "fifty-three million, twenty-six thousand, five hundred five".

Divisors: 1 5 7 35 97 485 679 3395 15619 78095 109333 546665 1515043 7575215 10605301 53026505