Search a number
-
+
51531014561 = 133963924197
BaseRepresentation
bin101111111111011111…
…001110000110100001
311221000021200202202212
4233333133032012201
51321013414431221
635401212251505
73502662253025
oct577737160641
9157007622685
1051531014561
111a943a06a44
129ba1770b95
134b230009c0
1426cbbc8385
151518eb8b5b
hexbff7ce1a1

51531014561 has 4 divisors (see below), whose sum is σ = 55494938772. Its totient is φ = 47567090352.

The previous prime is 51531014543. The next prime is 51531014603. The reversal of 51531014561 is 16541013515.

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

It can be written as a sum of positive squares in 2 ways, for example, as 34171371025 + 17359643536 = 184855^2 + 131756^2 .

It is a cyclic number.

It is not a de Polignac number, because 51531014561 - 214 = 51530998177 is a prime.

It is a Curzon number.

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

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

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

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

Almost surely, 251531014561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3963924210.

The product of its (nonzero) digits is 9000, while the sum is 32.

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

Divisors: 1 13 3963924197 51531014561