Search a number
-
+
51124354051 = 100950668339
BaseRepresentation
bin101111100111001111…
…111011110000000011
311212221221111021102111
4233213033323300003
51314200313312201
635253004200151
73456623560621
oct574717736003
9155857437374
1051124354051
111a755401981
129aa9539057
134a89999894
14268dbac511
1514e343bb51
hexbe73fbc03

51124354051 has 4 divisors (see below), whose sum is σ = 51175023400. Its totient is φ = 51073684704.

The previous prime is 51124354027. The next prime is 51124354079. The reversal of 51124354051 is 15045342115.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 51124354051 - 25 = 51124354019 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 251124354051 is an apocalyptic number.

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

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

51124354051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 50669348.

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

Adding to 51124354051 its reverse (15045342115), we get a palindrome (66169696166).

The spelling of 51124354051 in words is "fifty-one billion, one hundred twenty-four million, three hundred fifty-four thousand, fifty-one".

Divisors: 1 1009 50668339 51124354051