Search a number
-
+
51105006056011 = 347187409785857
BaseRepresentation
bin10111001111010110011111…
…01110110111001001001011
320200221120221202000000201111
423213223033232313021023
523144301023022243021
6300405152104031151
713523133456055135
oct1347531756671113
9220846852000644
1051105006056011
1115313569683056
1258945ab1624b7
13226924869a46b
14c896d18ac055
155d9559d618e1
hex2e7acfbb724b

51105006056011 has 8 divisors (see below), whose sum is σ = 51252621427440. Its totient is φ = 50957392631808.

The previous prime is 51105006056009. The next prime is 51105006056113. The reversal of 51105006056011 is 11065060050115.

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

It is a cyclic number.

It is not a de Polignac number, because 51105006056011 - 21 = 51105006056009 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (51105006036011) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64637995 + ... + 65423851.

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

Almost surely, 251105006056011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 973613.

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

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

Divisors: 1 347 187409 785857 65030923 272692379 147276674513 51105006056011