Search a number
-
+
56011100111 = 311806809681
BaseRepresentation
bin110100001010100001…
…011000111111001111
312100120111202200210022
4310022201120333033
51404202320200421
641421532132355
74022002331651
oct641241307717
9170514680708
1056011100111
112183289558a
12aa320070bb
135388223cb5
1429d4bcc6d1
1516cc4717ab
hexd0a858fcf

56011100111 has 4 divisors (see below), whose sum is σ = 57817909824. Its totient is φ = 54204290400.

The previous prime is 56011100099. The next prime is 56011100147. The reversal of 56011100111 is 11100111065.

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 56011100111 - 210 = 56011099087 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 56011100111.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (56011106111) 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, 903404810 + ... + 903404871.

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

Almost surely, 256011100111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1806809712.

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

Adding to 56011100111 its reverse (11100111065), we get a palindrome (67111211176).

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

Divisors: 1 31 1806809681 56011100111