Search a number
-
+
50511565331 = 3671319104347
BaseRepresentation
bin101111000010101110…
…010101001000010011
311211101020102101022222
4233002232111020103
51311421430042311
635112114051255
73435503135603
oct570256251023
9154336371288
1050511565331
111a470509717
129958279b2b
1349bca43cc6
142632656c03
1514a9744adb
hexbc2b95213

50511565331 has 8 divisors (see below), whose sum is σ = 50688084480. Its totient is φ = 50335258248.

The previous prime is 50511565319. The next prime is 50511565411. The reversal of 50511565331 is 13356511505.

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 50511565331 - 210 = 50511564307 is a prime.

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

It is a Duffinian number.

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

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

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 7 ways as a sum of consecutive naturals, for example, 431900 + ... + 536246.

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

Almost surely, 250511565331 is an apocalyptic number.

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

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

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

The sum of its prime factors is 106033.

The product of its (nonzero) digits is 33750, while the sum is 35.

The spelling of 50511565331 in words is "fifty billion, five hundred eleven million, five hundred sixty-five thousand, three hundred thirty-one".

Divisors: 1 367 1319 104347 484073 38295349 137633693 50511565331