Search a number
-
+
5605610110051 = 7898997769037
BaseRepresentation
bin101000110010010100001…
…1001100011110001100011
3201211220001121101022010011
41101210220121203301203
51213320242142010201
615531103130545351
71115664146522140
oct121445031436143
921756047338104
105605610110051
111871364850846
127664a3598257
133187b70a8903
14155454b473c7
159ac34d5e151
hex51928663c63

5605610110051 has 8 divisors (see below), whose sum is σ = 6478393707360. Its totient is φ = 4750822051008.

The previous prime is 5605610110021. The next prime is 5605610110057. The reversal of 5605610110051 is 1500110165065.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5605610109995 and 5605610110022.

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

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

Almost surely, 25605610110051 is an apocalyptic number.

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

5605610110051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8997769133.

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

The spelling of 5605610110051 in words is "five trillion, six hundred five billion, six hundred ten million, one hundred ten thousand, fifty-one".

Divisors: 1 7 89 623 8997769037 62984383259 800801444293 5605610110051