Search a number
-
+
56110050110 = 255611005011
BaseRepresentation
bin110100010000011010…
…110110101100111110
312100211101221212200002
4310100122312230332
51404403133100420
641435425034302
74024313361632
oct642032665476
9170741855602
1056110050110
112188372a144
12aa5b185992
1353a288a8aa
142a03dc8dc2
1516d5eba075
hexd106b6b3e

56110050110 has 8 divisors (see below), whose sum is σ = 100998090216. Its totient is φ = 22444020040.

The previous prime is 56110050103. The next prime is 56110050119. The reversal of 56110050110 is 1105001165.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 256110050110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5611005018.

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 56110050110 its reverse (1105001165), we get a palindrome (57215051275).

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

Divisors: 1 2 5 10 5611005011 11222010022 28055025055 56110050110