Search a number
-
+
50000000005001 is a prime number
BaseRepresentation
bin10110101111001100010000…
…01111010011001110001001
320120000221201222011112000002
423113212020033103032021
523023200000000130001
6254201403301252345
713350244416441524
oct1327461017231611
9216027658145002
1050000000005001
1114a27976561922
125736402a040b5
1321b8c97725337
14c4c027609bbb
155ba934b6146b
hex2d79883d3389

50000000005001 has 2 divisors, whose sum is σ = 50000000005002. Its totient is φ = 50000000005000.

The previous prime is 50000000004979. The next prime is 50000000005037. The reversal of 50000000005001 is 10050000000005.

50000000005001 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 can be written as a sum of positive squares in only one way, i.e., 30374648142400 + 19625351862601 = 5511320^2 + 4430051^2 .

It is a cyclic number.

It is not a de Polignac number, because 50000000005001 - 210 = 50000000003977 is a prime.

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

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

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

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

Almost surely, 250000000005001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 50000000005001 its reverse (10050000000005), we get a palindrome (60050000005006).

The spelling of 50000000005001 in words is "fifty trillion, five thousand, one".