Search a number
-
+
11010101002001 is a prime number
BaseRepresentation
bin1010000000110111110100…
…1010001011111100010001
31102222112222212110202010122
42200031331022023330101
52420342141324031001
635225545351040025
72214311365242623
oct240157512137421
942875885422118
1011010101002001
1135653a2a8a252
1212999b8670015
1361b32c01610a
142a0c6acaac13
151415e8368b1b
hexa037d28bf11

11010101002001 has 2 divisors, whose sum is σ = 11010101002002. Its totient is φ = 11010101002000.

The previous prime is 11010101001943. The next prime is 11010101002039. The reversal of 11010101002001 is 10020010101011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6923844942400 + 4086256059601 = 2631320^2 + 2021449^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010101002001 - 230 = 11009027260177 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11010101002001.

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

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

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

Almost surely, 211010101002001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 11010101002001 its reverse (10020010101011), we get a palindrome (21030111103012).

The spelling of 11010101002001 in words is "eleven trillion, ten billion, one hundred one million, two thousand, one".