Search a number
-
+
50010131 is a prime number
BaseRepresentation
bin1011111011000…
…1100000010011
310111002210000002
42332301200103
5100300311011
64543520215
71145036063
oct276614023
9114083002
1050010131
1126258396
12148b906b
13a48cbc2
1468db3a3
1545ccc3b
hex2fb1813

50010131 has 2 divisors, whose sum is σ = 50010132. Its totient is φ = 50010130.

The previous prime is 50010127. The next prime is 50010137. The reversal of 50010131 is 13101005.

50010131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50010131 - 22 = 50010127 is a prime.

It is a super-2 number, since 2×500101312 = 5002026405274322, which contains 22 as substring.

It is a Chen prime.

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

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

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

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

Almost surely, 250010131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 11.

The square root of 50010131 is about 7071.7841454615. The cubic root of 50010131 is about 368.4280301324.

Adding to 50010131 its reverse (13101005), we get a palindrome (63111136).

The spelling of 50010131 in words is "fifty million, ten thousand, one hundred thirty-one".