Search a number
-
+
50505215560507 = 173220519224921
BaseRepresentation
bin10110111101111001010010…
…11011101100101100111011
320121211020210022100220101001
423132330221123230230323
523104434140140414012
6255225435320105431
713431611216011321
oct1336745133545473
9217736708326331
1050505215560507
1115102161574374
1257b82ba605277
132224810274416
14c686733a1d11
155c8b535c9357
hex2def296ecb3b

50505215560507 has 8 divisors (see below), whose sum is σ = 53476282438992. Its totient is φ = 47534167776000.

The previous prime is 50505215560469. The next prime is 50505215560519. The reversal of 50505215560507 is 70506551250505.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50505215560507 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 862407 + ... + 10087327.

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

Almost surely, 250505215560507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9546989.

The product of its (nonzero) digits is 1312500, while the sum is 46.

The spelling of 50505215560507 in words is "fifty trillion, five hundred five billion, two hundred fifteen million, five hundred sixty thousand, five hundred seven".

Divisors: 1 17 322051 5474867 9224921 156823657 2970895032971 50505215560507