Search a number
-
+
10500005050001 is a prime number
BaseRepresentation
bin1001100011001011100100…
…0100100011011010010001
31101011210100101221112100222
42120302321010203122101
52334013002243100001
634155345152322425
72132412625215665
oct230627104433221
941153311845328
1010500005050001
113389033130675
121216b7a543415
135b21b9353a5c
142842baca88a5
151331e122261b
hex98cb9123691

10500005050001 has 2 divisors, whose sum is σ = 10500005050002. Its totient is φ = 10500005050000.

The previous prime is 10500005049973. The next prime is 10500005050009. The reversal of 10500005050001 is 10005050000501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8346037880401 + 2153967169600 = 2888951^2 + 1467640^2 .

It is a cyclic number.

It is not a de Polignac number, because 10500005050001 - 238 = 10225127143057 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10500005050009) 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 as a sum of consecutive naturals, namely, 5250002525000 + 5250002525001.

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

Almost surely, 210500005050001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 125, while the sum is 17.

Adding to 10500005050001 its reverse (10005050000501), we get a palindrome (20505055050502).

The spelling of 10500005050001 in words is "ten trillion, five hundred billion, five million, fifty thousand, one".