Search a number
-
+
101111010011101 is a prime number
BaseRepresentation
bin10110111111010110111101…
…110101011010011111011101
3111021000010012010122210220101
4112333112331311122133131
5101223100322030323401
6555013431243021101
730204013041336436
oct2677267565323735
9437003163583811
10101111010011101
112a242a362134a2
12b40bba880a791
13445595bc4248c
141ad7b2863448d
15ba51e1b3b101
hex5bf5bdd5a7dd

101111010011101 has 2 divisors, whose sum is σ = 101111010011102. Its totient is φ = 101111010011100.

The previous prime is 101111010011003. The next prime is 101111010011149. The reversal of 101111010011101 is 101110010111101.

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., 59164325667225 + 41946684343876 = 7691835^2 + 6476626^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101111010011101 - 27 = 101111010010973 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2101111010011101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 10.

Adding to 101111010011101 its reverse (101110010111101), we get a palindrome (202221020122202).

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