Search a number
-
+
110201001001061 is a prime number
BaseRepresentation
bin11001000011101000101011…
…100001001100000001100101
3112110012010001020101120220212
4121003220223201030001211
5103421013122224013221
61030213350240505205
732132521352034155
oct3103505341140145
9473163036346825
10110201001001061
1132127a891492a3
121043983831b205
134964ba9abb349
141d2da84d50765
15cb18aa9b4b5b
hex643a2b84c065

110201001001061 has 2 divisors, whose sum is σ = 110201001001062. Its totient is φ = 110201001001060.

The previous prime is 110201001001031. The next prime is 110201001001127. The reversal of 110201001001061 is 160100100102011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77387648850625 + 32813352150436 = 8797025^2 + 5728294^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2110201001001061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 14.

Adding to 110201001001061 its reverse (160100100102011), we get a palindrome (270301101103072).

The spelling of 110201001001061 in words is "one hundred ten trillion, two hundred one billion, one million, one thousand, sixty-one".