Search a number
-
+
53010507 = 3111606379
BaseRepresentation
bin1100101000111…
…0000001001011
310200202012202010
43022032001023
5102032314012
65132111003
71212403404
oct312160113
9120665663
1053010507
1127a17640
1215905463
13aca0784
14707c9ab
1549c1c3c
hex328e04b

53010507 has 8 divisors (see below), whose sum is σ = 77106240. Its totient is φ = 32127560.

The previous prime is 53010491. The next prime is 53010509. The reversal of 53010507 is 70501035.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 53010507 - 24 = 53010491 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (53010509) 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 7 ways as a sum of consecutive naturals, for example, 803157 + ... + 803222.

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

Almost surely, 253010507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1606393.

The product of its (nonzero) digits is 525, while the sum is 21.

The square root of 53010507 is about 7280.8314772421. The cubic root of 53010507 is about 375.6533959797.

The spelling of 53010507 in words is "fifty-three million, ten thousand, five hundred seven".

Divisors: 1 3 11 33 1606379 4819137 17670169 53010507