Search a number
-
+
50500050391 = 719379699627
BaseRepresentation
bin101111000010000010…
…011001110111010111
311211100102202100210201
4233002002121313113
51311411003103031
635111023201331
73435303226420
oct570202316727
9154312670721
1050500050391
111a464a6433a
129954446247
1349ba541a2b
142630cda647
1514a871cd61
hexbc2099dd7

50500050391 has 8 divisors (see below), whose sum is σ = 60751940480. Its totient is φ = 41007559608.

The previous prime is 50500050319. The next prime is 50500050401. The reversal of 50500050391 is 19305000505.

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

It is a cyclic number.

It is not a de Polignac number, because 50500050391 - 29 = 50500049879 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 250500050391 is an apocalyptic number.

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

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

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

The sum of its prime factors is 379699653.

The product of its (nonzero) digits is 3375, while the sum is 28.

Adding to 50500050391 its reverse (19305000505), we get a palindrome (69805050896).

The spelling of 50500050391 in words is "fifty billion, five hundred million, fifty thousand, three hundred ninety-one".

Divisors: 1 7 19 133 379699627 2657897389 7214292913 50500050391