Search a number
-
+
53015105 = 51113531399
BaseRepresentation
bin1100101000111…
…1001001000001
310200202110001102
43022033021001
5102032440410
65132144145
71212422663
oct312171101
9120673042
1053015105
1127a20040
1215908055
13aca28b0
147080533
1549c32a5
hex328f241

53015105 has 32 divisors (see below), whose sum is σ = 76204800. Its totient is φ = 34894080.

The previous prime is 53015101. The next prime is 53015113. The reversal of 53015105 is 50151035.

It is a happy number.

It is not a de Polignac number, because 53015105 - 22 = 53015101 is a prime.

It is a super-2 number, since 2×530151052 = 5621202716322050, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (53015101) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37196 + ... + 38594.

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

Almost surely, 253015105 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1481.

The product of its (nonzero) digits is 375, while the sum is 20.

The square root of 53015105 is about 7281.1472310344. The cubic root of 53015105 is about 375.6642567473.

The spelling of 53015105 in words is "fifty-three million, fifteen thousand, one hundred five".

Divisors: 1 5 11 13 53 55 65 143 265 583 689 715 1399 2915 3445 6995 7579 15389 18187 37895 74147 76945 90935 200057 370735 815617 963911 1000285 4078085 4819555 10603021 53015105