Search a number
-
+
50500555555555 = 5710871327390079
BaseRepresentation
bin10110111101110000100111…
…01011001100001011100011
320121210210202112202010100001
423132320103223030023203
523104400114210234210
6255223345052040431
713431354562431130
oct1336702353141343
9217723675663301
1050500555555555
1115100190078706
1257b7419a63117
1322242499a7b41
14c68350525587
155c897e43203a
hex2dee13acc2e3

50500555555555 has 16 divisors (see below), whose sum is σ = 69321619537920. Its totient is φ = 34597094992992.

The previous prime is 50500555555511. The next prime is 50500555555601. The reversal of 50500555555555 is 55555555500505.

It is not a de Polignac number, because 50500555555555 - 237 = 50363116602083 is a prime.

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

50500555555555 is a modest number, since divided by 5555555 gives 5050055 as remainder.

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

It is an unprimeable number.

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

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

Almost surely, 250500555555555 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1327391178.

The product of its (nonzero) digits is 48828125, while the sum is 55.

The spelling of 50500555555555 in words is "fifty trillion, five hundred billion, five hundred fifty-five million, five hundred fifty-five thousand, five hundred fifty-five".

Divisors: 1 5 7 35 1087 5435 7609 38045 1327390079 6636950395 9291730553 46458652765 1442873015873 7214365079365 10100111111111 50500555555555