Search a number
-
+
5606011050050 = 252112120221001
BaseRepresentation
bin101000110010100000001…
…0011000001100001000010
3201211221002112211011101202
41101211000103001201002
51213322102312100200
615531211012301202
71116010115460335
oct121450023014102
921757075734352
105606011050050
1118715500a8a14
12766595911802
1331884c189008
141554920b461c
159ac5a15b1d5
hex519404c1842

5606011050050 has 12 divisors (see below), whose sum is σ = 10427180553186. Its totient is φ = 2242404420000.

The previous prime is 5606011050049. The next prime is 5606011050053. The reversal of 5606011050050 is 500501106065.

It can be written as a sum of positive squares in 3 ways, for example, as 3012484393801 + 2593526656249 = 1735651^2 + 1610443^2 .

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

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

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

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

Almost surely, 25606011050050 is an apocalyptic number.

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

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

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

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

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

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

The spelling of 5606011050050 in words is "five trillion, six hundred six billion, eleven million, fifty thousand, fifty".

Divisors: 1 2 5 10 25 50 112120221001 224240442002 560601105005 1121202210010 2803005525025 5606011050050