Search a number
-
+
51100111005 = 353406674067
BaseRepresentation
bin101111100101110011…
…011101000010011101
311212220020212121012220
4233211303131002131
51314123112023010
635250340415553
73456210530316
oct574563350235
9155806777186
1051100111005
111a7427537a9
129aa13a75b9
134a8495c098
14268a89b60d
1514e124d970
hexbe5cdd09d

51100111005 has 8 divisors (see below), whose sum is σ = 81760177632. Its totient is φ = 27253392528.

The previous prime is 51100111003. The next prime is 51100111009. The reversal of 51100111005 is 50011100115.

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

It is not a de Polignac number, because 51100111005 - 21 = 51100111003 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 3406674067 = 51100111005 / (5 + 1 + 1 + 0 + 0 + 1 + 1 + 1 + 0 + 0 + 5).

It is a congruent number.

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

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

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

Almost surely, 251100111005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3406674075.

The product of its (nonzero) digits is 25, while the sum is 15.

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

Divisors: 1 3 5 15 3406674067 10220022201 17033370335 51100111005