Search a number
-
+
52646251 = 747160019
BaseRepresentation
bin1100100011010…
…1000101101011
310200001201002011
43020311011223
5101434140001
65120220351
71206325420
oct310650553
9120051064
1052646251
11277989a9
121576a6b7
13aba3a38
146dc5d47
15494dd51
hex323516b

52646251 has 8 divisors (see below), whose sum is σ = 61447680. Its totient is φ = 44164968.

The previous prime is 52646239. The next prime is 52646257. The reversal of 52646251 is 15264625.

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

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 52646251 - 27 = 52646123 is a prime.

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

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

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

Almost surely, 252646251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 160073.

The product of its digits is 14400, while the sum is 31.

The square root of 52646251 is about 7255.7736320809. The cubic root of 52646251 is about 374.7909970171.

The spelling of 52646251 in words is "fifty-two million, six hundred forty-six thousand, two hundred fifty-one".

Divisors: 1 7 47 329 160019 1120133 7520893 52646251