Search a number
-
+
50005610497 is a prime number
BaseRepresentation
bin101110100100100100…
…010001000000000001
311210001222101012210001
4232210210101000001
51304402414013442
634550001440001
73420120450613
oct564444210001
9153058335701
1050005610497
111a230955327
129836940001
13493bc8564b
1425c5390db3
15147a1022b7
hexba4911001

50005610497 has 2 divisors, whose sum is σ = 50005610498. Its totient is φ = 50005610496.

The previous prime is 50005610477. The next prime is 50005610531. The reversal of 50005610497 is 79401650005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 30384324721 + 19621285776 = 174311^2 + 140076^2 .

It is a cyclic number.

It is not a de Polignac number, because 50005610497 - 211 = 50005608449 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (50005610437) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25002805248 + 25002805249.

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

Almost surely, 250005610497 is an apocalyptic number.

It is an amenable number.

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

50005610497 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 37800, while the sum is 37.

The spelling of 50005610497 in words is "fifty billion, five million, six hundred ten thousand, four hundred ninety-seven".