Search a number
-
+
10411003002193 is a prime number
BaseRepresentation
bin1001011110000000000000…
…1000101011110101010001
31100212021121200220001021221
42113200000020223311101
52331033213232032233
634050425421445041
72123112234254023
oct227400010536521
940767550801257
1010411003002193
113354310864862
12120187ba10781
135a69a4202841
1427dc76744013
15130c327c042d
hex9780022bd51

10411003002193 has 2 divisors, whose sum is σ = 10411003002194. Its totient is φ = 10411003002192.

The previous prime is 10411003002187. The next prime is 10411003002331. The reversal of 10411003002193 is 39120030011401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5286651729984 + 5124351272209 = 2299272^2 + 2263703^2 .

It is an emirp because it is prime and its reverse (39120030011401) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10411003002193 - 25 = 10411003002161 is a prime.

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

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

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

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

Almost surely, 210411003002193 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10411003002193 its reverse (39120030011401), we get a palindrome (49531033013594).

The spelling of 10411003002193 in words is "ten trillion, four hundred eleven billion, three million, two thousand, one hundred ninety-three".