Search a number
-
+
51155566001 = 166930650429
BaseRepresentation
bin101111101001000110…
…111111110110110001
311220001010020000011122
4233221012333312301
51314231311103001
635300041152025
73460453064561
oct575106776661
9156033200148
1051155566001
111a770a8a981
129ab7a8b615
134a932a73a7
142693db4da1
1514e6054b1b
hexbe91bfdb1

51155566001 has 4 divisors (see below), whose sum is σ = 51186218100. Its totient is φ = 51124913904.

The previous prime is 51155565983. The next prime is 51155566003. The reversal of 51155566001 is 10066555115.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10066555115 = 52013311023.

It can be written as a sum of positive squares in 2 ways, for example, as 24586240000 + 26569326001 = 156800^2 + 163001^2 .

It is a cyclic number.

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

It is a Duffinian number.

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

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

Almost surely, 251155566001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30652098.

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

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

Divisors: 1 1669 30650429 51155566001