Search a number
-
+
560501055050 = 25211210021101
BaseRepresentation
bin10000010100000000111…
…01110101111001001010
31222120202021121202022012
420022000131311321022
533140401232230200
61105253550455522
755331511234056
oct10120035657112
91876667552265
10560501055050
111a6786262642
12907668045a2
1340b1663c331
141d1b2464c66
15e8a735ba35
hex8280775e4a

560501055050 has 12 divisors (see below), whose sum is σ = 1042531962486. Its totient is φ = 224200422000.

The previous prime is 560501055041. The next prime is 560501055073. The reversal of 560501055050 is 50550105065.

It can be written as a sum of positive squares in 3 ways, for example, as 258784846681 + 301716208369 = 508709^2 + 549287^2 .

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

It is a Curzon number.

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

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, 5605010501 + ... + 5605010600.

Almost surely, 2560501055050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 18750, while the sum is 32.

The spelling of 560501055050 in words is "five hundred sixty billion, five hundred one million, fifty-five thousand, fifty".

Divisors: 1 2 5 10 25 50 11210021101 22420042202 56050105505 112100211010 280250527525 560501055050