Search a number
-
+
51106400000 = 2855193331
BaseRepresentation
bin101111100110001011…
…011100011100000000
311212220200201010002122
4233212023130130000
51314131214300000
635251123303412
73456315142505
oct574613343400
9155820633078
1051106400000
111a746259817
129aa351ab68
134a86051796
14268b6574ac
1514e1a92085
hexbe62dc700

51106400000 has 216 divisors, whose sum is σ = 128556178128. Its totient is φ = 20275200000.

The previous prime is 51106399969. The next prime is 51106400027. The reversal of 51106400000 is 460115.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 154399835 + ... + 154400165.

Almost surely, 251106400000 is an apocalyptic number.

51106400000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 51106400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64278089064).

51106400000 is an abundant number, since it is smaller than the sum of its proper divisors (77449778128).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

51106400000 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 565 (or 531 counting only the distinct ones).

The product of its (nonzero) digits is 120, while the sum is 17.

Adding to 51106400000 its reverse (460115), we get a palindrome (51106860115).

The spelling of 51106400000 in words is "fifty-one billion, one hundred six million, four hundred thousand".