Search a number
-
+
56016115013 = 1779280114891
BaseRepresentation
bin110100001010110100…
…100001010101000101
312100120212012110221102
4310022310201111011
51404210111140023
641422231425445
74022063056445
oct641264412505
9170525173842
1056016115013
1121835700331
12aa33825285
13538928b7b1
1429d5736125
1516ccb12628
hexd0ad21545

56016115013 has 16 divisors (see below), whose sum is σ = 60087432960. Its totient is φ = 52031616000.

The previous prime is 56016114997. The next prime is 56016115019. The reversal of 56016115013 is 31051161065.

It is a cyclic number.

It is not a de Polignac number, because 56016115013 - 24 = 56016114997 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3754298 + ... + 3769188.

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

Almost surely, 256016115013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17788.

The product of its (nonzero) digits is 2700, while the sum is 29.

Adding to 56016115013 its reverse (31051161065), we get a palindrome (87067276078).

The spelling of 56016115013 in words is "fifty-six billion, sixteen million, one hundred fifteen thousand, thirteen".

Divisors: 1 17 79 1343 2801 14891 47617 221279 253147 1176389 3761743 19998613 41709691 709064747 3295065589 56016115013