Search a number
-
+
56050111001 = 173297065353
BaseRepresentation
bin110100001100110110…
…001101001000011001
312100200020011122200002
4310030312031020121
51404242312023001
641425444222345
74022655040223
oct641466151031
9170606148602
1056050111001
112185290aa95
12aa4309a9b5
135393332571
1429da065413
1516d0aca46b
hexd0cd8d219

56050111001 has 4 divisors (see below), whose sum is σ = 59347176372. Its totient is φ = 52753045632.

The previous prime is 56050110983. The next prime is 56050111003. The reversal of 56050111001 is 10011105065.

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

It can be written as a sum of positive squares in 2 ways, for example, as 31302101776 + 24748009225 = 176924^2 + 157315^2 .

It is a cyclic number.

It is not a de Polignac number, because 56050111001 - 26 = 56050110937 is a prime.

It is a super-2 number, since 2×560501110012 (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 (56050111003) by changing a digit.

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

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

Almost surely, 256050111001 is an apocalyptic number.

It is an amenable number.

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

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

56050111001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3297065370.

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

Adding to 56050111001 its reverse (10011105065), we get a palindrome (66061216066).

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

Divisors: 1 17 3297065353 56050111001