Search a number
-
+
51060500507 = 233219143779
BaseRepresentation
bin101111100011011100…
…010110100000011011
311212210111100011211102
4233203130112200123
51314032442004012
635242403422015
73455220043652
oct574334264033
9155714304742
1051060500507
111a722359855
129a9008490b
134a796a0913
14268550a199
1514dca272c2
hexbe371681b

51060500507 has 4 divisors (see below), whose sum is σ = 51279644520. Its totient is φ = 50841356496.

The previous prime is 51060500461. The next prime is 51060500537. The reversal of 51060500507 is 70500506015.

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

It is a cyclic number.

It is not a de Polignac number, because 51060500507 - 226 = 50993391643 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 251060500507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 219144012.

The product of its (nonzero) digits is 5250, while the sum is 29.

The spelling of 51060500507 in words is "fifty-one billion, sixty million, five hundred thousand, five hundred seven".

Divisors: 1 233 219143779 51060500507