Search a number
-
+
51103043405 = 510220608681
BaseRepresentation
bin101111100101111110…
…101000111101001101
311212220110101120201022
4233211332220331031
51314124334342110
635250523323525
73456244462511
oct574576507515
9155813346638
1051103043405
111a744376977
129aa23805a5
134a85447a2b
14268b022141
1514e162c755
hexbe5fa8f4d

51103043405 has 4 divisors (see below), whose sum is σ = 61323652092. Its totient is φ = 40882434720.

The previous prime is 51103043377. The next prime is 51103043429. The reversal of 51103043405 is 50434030115.

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 29064453289 + 22038590116 = 170483^2 + 148454^2 .

It is not a de Polignac number, because 51103043405 - 226 = 51035934541 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 251103043405 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10220608686.

The product of its (nonzero) digits is 3600, while the sum is 26.

The spelling of 51103043405 in words is "fifty-one billion, one hundred three million, forty-three thousand, four hundred five".

Divisors: 1 5 10220608681 51103043405