Search a number
-
+
51705170551 = 107483225893
BaseRepresentation
bin110000001001110111…
…100100101001110111
311221110102101210212201
4300021313210221313
51321343010424201
635430353125331
73510205461316
oct601167445167
9157412353781
1051705170551
111aa23247a11
12a02bb59847
134b50109898
142706da027d
15152941a801
hexc09de4a77

51705170551 has 4 divisors (see below), whose sum is σ = 52188396552. Its totient is φ = 51221944552.

The previous prime is 51705170533. The next prime is 51705170603. The reversal of 51705170551 is 15507150715.

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 51705170551 - 29 = 51705170039 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 51705170551.

It is a congruent number.

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

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

Almost surely, 251705170551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 483226000.

The product of its (nonzero) digits is 30625, while the sum is 37.

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

Divisors: 1 107 483225893 51705170551