Search a number
-
+
51150176513 = 141773607969
BaseRepresentation
bin101111101000110010…
…011100000100000001
311220000202002012011222
4233220302130010001
51314223421122023
635255325444425
73460356220022
oct575062340401
9156022065158
1051150176513
111a768a39757
129ab6110715
134a9213b247
1426933b0c49
1514e583ccc8
hexbe8c9c101

51150176513 has 4 divisors (see below), whose sum is σ = 51153798660. Its totient is φ = 51146554368.

The previous prime is 51150176509. The next prime is 51150176533. The reversal of 51150176513 is 31567105115.

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 43751252224 + 7398924289 = 209168^2 + 86017^2 .

It is a cyclic number.

It is not a de Polignac number, because 51150176513 - 22 = 51150176509 is a prime.

It is a super-2 number, since 2×511501765132 (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 (51150176533) by changing a digit.

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

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

Almost surely, 251150176513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3622146.

The product of its (nonzero) digits is 15750, while the sum is 35.

The spelling of 51150176513 in words is "fifty-one billion, one hundred fifty million, one hundred seventy-six thousand, five hundred thirteen".

Divisors: 1 14177 3607969 51150176513