Search a number
-
+
52251515031 = 3132411315397
BaseRepresentation
bin110000101010011011…
…101101100010010111
311222212111102222121110
4300222123231202113
51324002341440111
640000511150103
73526561356342
oct605233554227
9158774388543
1052251515031
1120183688681
12a162b15333
134c0936a241
14275977b459
15155c38a5a6
hexc2a6ed897

52251515031 has 8 divisors (see below), whose sum is σ = 69674001264. Its totient is φ = 34831686080.

The previous prime is 52251514999. The next prime is 52251515047. The reversal of 52251515031 is 13051515225.

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 52251515031 - 25 = 52251514999 is a prime.

It is a super-2 number, since 2×522515150312 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 52251515031.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 617976 + ... + 697421.

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

Almost surely, 252251515031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1328641.

The product of its (nonzero) digits is 7500, while the sum is 30.

The spelling of 52251515031 in words is "fifty-two billion, two hundred fifty-one million, five hundred fifteen thousand, thirty-one".

Divisors: 1 3 13241 39723 1315397 3946191 17417171677 52251515031