Search a number
-
+
51131260651 = 2953136124443
BaseRepresentation
bin101111100111101010…
…010001111011101011
311212222102111011111111
4233213222101323223
51314204100320101
635253412211151
73460036354522
oct574752217353
9155872434444
1051131260651
111a759299a09
129aab909ab7
134a8b247423
142690a894b9
1514e3d53251
hexbe7a91eeb

51131260651 has 16 divisors (see below), whose sum is σ = 53934219360. Its totient is φ = 48399070720.

The previous prime is 51131260603. The next prime is 51131260669. The reversal of 51131260651 is 15606213115.

It is a happy number.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51131260651 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 251131260651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25886.

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

Adding to 51131260651 its reverse (15606213115), we get a palindrome (66737473766).

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

Divisors: 1 29 53 1361 1537 24443 39469 72133 708847 1295479 2091857 33266923 37568891 964740767 1763146919 51131260651