Search a number
-
+
56050110011 = 78007158573
BaseRepresentation
bin110100001100110110…
…001100111000111011
312100200020011121022102
4310030312030320323
51404242312010021
641425444214015
74022655034310
oct641466147073
9170606147272
1056050110011
112185290a275
12aa4309a30b
135393331c8c
1429da064d07
1516d0aca00b
hexd0cd8ce3b

56050110011 has 4 divisors (see below), whose sum is σ = 64057268592. Its totient is φ = 48042951432.

The previous prime is 56050109993. The next prime is 56050110019. The reversal of 56050110011 is 11001105065.

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

It is not a de Polignac number, because 56050110011 - 226 = 55983001147 is a prime.

It is a super-2 number, since 2×560501100112 (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 (56050110019) 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, 4003579280 + ... + 4003579293.

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

Almost surely, 256050110011 is an apocalyptic number.

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

56050110011 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8007158580.

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

Adding to 56050110011 its reverse (11001105065), we get a palindrome (67051215076).

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

Divisors: 1 7 8007158573 56050110011