Search a number
-
+
53014015 = 510602803
BaseRepresentation
bin1100101000111…
…0110111111111
310200202101120001
43022032313333
5102032422030
65132135131
71212416545
oct312166777
9120671501
1053014015
1127a1a23a
12159074a7
13aca2252
14707dd95
1549c2cca
hex328edff

53014015 has 4 divisors (see below), whose sum is σ = 63616824. Its totient is φ = 42411208.

The previous prime is 53013967. The next prime is 53014019. The reversal of 53014015 is 51041035.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 53014015 - 27 = 53013887 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5301397 + ... + 5301406.

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

Almost surely, 253014015 is an apocalyptic number.

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

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

53014015 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10602808.

The product of its (nonzero) digits is 300, while the sum is 19.

The square root of 53014015 is about 7281.0723798078. The cubic root of 53014015 is about 375.6616821549.

It can be divided in two parts, 5301 and 4015, that added together give a triangular number (9316 = T136).

The spelling of 53014015 in words is "fifty-three million, fourteen thousand, fifteen".

Divisors: 1 5 10602803 53014015