Search a number
-
+
50361205169 = 114578291379
BaseRepresentation
bin101110111001110000…
…110000000110110001
311210222202111021222002
4232321300300012301
51311114432031134
635045143223345
73431666116022
oct567160600661
9153882437862
1050361205169
111a3a3650920
129915a47b55
13499784a1b2
14261a6b6c49
15149b44387e
hexbb9c301b1

50361205169 has 4 divisors (see below), whose sum is σ = 54939496560. Its totient is φ = 45782913780.

The previous prime is 50361205159. The next prime is 50361205199. The reversal of 50361205169 is 96150216305.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 50361205169 - 28 = 50361204913 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50361205159) 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 3 ways as a sum of consecutive naturals, for example, 2289145679 + ... + 2289145700.

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

Almost surely, 250361205169 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4578291390.

The product of its (nonzero) digits is 48600, while the sum is 38.

The spelling of 50361205169 in words is "fifty billion, three hundred sixty-one million, two hundred five thousand, one hundred sixty-nine".

Divisors: 1 11 4578291379 50361205169