Search a number
-
+
56062671050 = 2521121253421
BaseRepresentation
bin110100001101100110…
…000111100011001010
312100201002210202211002
4310031212013203022
51404304020433200
641431013335002
74023166561361
oct641546074312
9170632722732
1056062671050
1121859a095a1
12aa47337462
135395b0c449
1429db9b47d8
1516d1c5bbd5
hexd0d9878ca

56062671050 has 12 divisors (see below), whose sum is σ = 104276568246. Its totient is φ = 22425068400.

The previous prime is 56062671023. The next prime is 56062671109. The reversal of 56062671050 is 5017626065.

It can be written as a sum of positive squares in 3 ways, for example, as 34646982769 + 21415688281 = 186137^2 + 146341^2 .

It is a Curzon number.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 560626661 + ... + 560626760.

Almost surely, 256062671050 is an apocalyptic number.

56062671050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

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

The product of its (nonzero) digits is 75600, while the sum is 38.

The spelling of 56062671050 in words is "fifty-six billion, sixty-two million, six hundred seventy-one thousand, fifty".

Divisors: 1 2 5 10 25 50 1121253421 2242506842 5606267105 11212534210 28031335525 56062671050