Search a number
-
+
56320151111 = 725903194713
BaseRepresentation
bin110100011100111100…
…010100111001000111
312101101001022010001122
4310130330110321013
51410320424313421
641512332144155
74032444246200
oct643474247107
9171331263048
1056320151111
1121981291134
12aab960805b
135407270703
142a23c7a5a7
1516e966c2ab
hexd1cf14e47

56320151111 has 12 divisors (see below), whose sum is σ = 65526712992. Its totient is φ = 48265989408.

The previous prime is 56320151099. The next prime is 56320151113. The reversal of 56320151111 is 11115102365.

It is not a de Polignac number, because 56320151111 - 214 = 56320134727 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (56320151113) 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 11 ways as a sum of consecutive naturals, for example, 191891 + ... + 386603.

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

Almost surely, 256320151111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 900, while the sum is 26.

Adding to 56320151111 its reverse (11115102365), we get a palindrome (67435253476).

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

Divisors: 1 7 49 5903 41321 194713 289247 1362991 9540937 1149390839 8045735873 56320151111