Search a number
-
+
11001110011901 is a prime number
BaseRepresentation
bin1010000000010110010101…
…0000010001111111111101
31102221200210021100010101022
42200011211100101333331
52420220233130340101
635221501250553525
72213542522135532
oct240054520217775
942850707303338
1011001110011901
1135615a9892319
1212981095988a5
1361a52839bb29
142a0656b5cd89
1514126dd6ba1b
hexa0165411ffd

11001110011901 has 2 divisors, whose sum is σ = 11001110011902. Its totient is φ = 11001110011900.

The previous prime is 11001110011883. The next prime is 11001110011951. The reversal of 11001110011901 is 10911001110011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7659050715001 + 3342059296900 = 2767499^2 + 1828130^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11001110011901 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211001110011901 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 11001110011901 its reverse (10911001110011), we get a palindrome (21912111121912).

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