Search a number
-
+
52261065031 = 761122391253
BaseRepresentation
bin110000101011000000…
…001001000101000111
311222220011102011202011
4300223000021011013
51324012313040111
640001451555051
73530035503040
oct605300110507
9158804364664
1052261065031
112018901073a
12a16615ba87
134c0b332026
14275ab458c7
15155d125021
hexc2b009147

52261065031 has 8 divisors (see below), whose sum is σ = 60706061984. Its totient is φ = 44060850720.

The previous prime is 52261064993. The next prime is 52261065071. The reversal of 52261065031 is 13056016225.

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 52261065031 - 27 = 52261064903 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (52261065071) 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, 61195200 + ... + 61196053.

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

Almost surely, 252261065031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 122391321.

The product of its (nonzero) digits is 10800, while the sum is 31.

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

Divisors: 1 7 61 427 122391253 856738771 7465866433 52261065031