Search a number
-
+
51110560560005 = 510222112112001
BaseRepresentation
bin10111001111100000110101…
…10011100111001110000101
320200222010021211210001202122
423213300122303213032011
523144343412000410010
6300411511204215325
713523421223423262
oct1347603263471605
9220863254701678
1051110560560005
1115315959a94121
12589569b39a545
13226992238560b
14c89a9b472269
155d97827ea855
hex2e7c1ace7385

51110560560005 has 4 divisors (see below), whose sum is σ = 61332672672012. Its totient is φ = 40888448448000.

The previous prime is 51110560559999. The next prime is 51110560560023. The reversal of 51110560560005 is 50006506501115.

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 35813067297604 + 15297493262401 = 5984402^2 + 3911201^2 .

It is not a de Polignac number, because 51110560560005 - 224 = 51110543782789 is a prime.

It is a super-2 number, since 2×511105605600052 (a number of 28 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 251110560560005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10222112112006.

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

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

Divisors: 1 5 10222112112001 51110560560005