Search a number
-
+
56050055010057 = 3313891549328441
BaseRepresentation
bin11001011111010001010111…
…00111100101011100001001
321100110022222201000210021110
430233220223213211130021
524321311003040310212
6315113012333000533
714543324420460243
oct1457505347453411
9240408881023243
1056050055010057
111694a770916449
126352a62023149
132537661043404
14dbaba1167093
15672ecd206a3c
hex32fa2b9e5709

56050055010057 has 16 divisors (see below), whose sum is σ = 77342475824640. Its totient is φ = 36068366083200.

The previous prime is 56050055010031. The next prime is 56050055010101. The reversal of 56050055010057 is 75001055005065.

It is not a de Polignac number, because 56050055010057 - 27 = 56050055009929 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 56050055009997 and 56050055010024.

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

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

Almost surely, 256050055010057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1549328864.

The product of its (nonzero) digits is 131250, while the sum is 39.

The spelling of 56050055010057 in words is "fifty-six trillion, fifty billion, fifty-five million, ten thousand, fifty-seven".

Divisors: 1 3 31 93 389 1167 12059 36177 1549328441 4647985323 48029181671 144087545013 602688763549 1808066290647 18683351670019 56050055010057