Search a number
-
+
50363224601 = 433116312297
BaseRepresentation
bin101110111001111000…
…011101001000011001
311210222220021220002212
4232321320131020121
51311120441141401
635045254404505
73432022226414
oct567170351031
9153886256085
1050363224601
111a3a4800078
129916660735
1349980a6421
14261aa80b7b
15149b6e1dbb
hexbb9e1d219

50363224601 has 4 divisors (see below), whose sum is σ = 50479537332. Its totient is φ = 50246911872.

The previous prime is 50363224579. The next prime is 50363224649. The reversal of 50363224601 is 10642236305.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 16448319001 + 33914905600 = 128251^2 + 184160^2 .

It is a cyclic number.

It is not a de Polignac number, because 50363224601 - 26 = 50363224537 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 250363224601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 116312730.

The product of its (nonzero) digits is 25920, while the sum is 32.

The spelling of 50363224601 in words is "fifty billion, three hundred sixty-three million, two hundred twenty-four thousand, six hundred one".

Divisors: 1 433 116312297 50363224601