Search a number
-
+
110001010100101 is a prime number
BaseRepresentation
bin11001000000101110011011…
…001000011100011110000101
3112102110222211112020011221221
4121000232123020130132011
5103404224032041200401
61025541433313440341
732112211401315031
oct3100563310343605
9472428745204857
10110001010100101
113206019153236a
1210406b238700b1
13494c087636923
141d2411215b1c1
15cab5a323b7a1
hex640b9b21c785

110001010100101 has 2 divisors, whose sum is σ = 110001010100102. Its totient is φ = 110001010100100.

The previous prime is 110001010100063. The next prime is 110001010100117. The reversal of 110001010100101 is 101001010100011.

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., 106346604377601 + 3654405722500 = 10312449^2 + 1911650^2 .

It is a cyclic number.

It is not a de Polignac number, because 110001010100101 - 229 = 110000473229189 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110001010100101 is an apocalyptic number.

It is an amenable number.

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

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

110001010100101 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 7.

Adding to 110001010100101 its reverse (101001010100011), we get a palindrome (211002020200112).

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