Search a number
-
+
110121022110061 is a prime number
BaseRepresentation
bin11001000010011110001100…
…011001111011100101101101
3112102220110121100222222000201
4121002132030121323211231
5103413210323130010221
61030112522115353501
732123660404500634
oct3102361431734555
9472813540888021
10110121022110061
11320a707714a776
12104262375b2891
13495a4a2167681
141d29c58d0c51b
15cae7792b5891
hex64278c67b96d

110121022110061 has 2 divisors, whose sum is σ = 110121022110062. Its totient is φ = 110121022110060.

The previous prime is 110121022110049. The next prime is 110121022110083. The reversal of 110121022110061 is 160011220121011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 72933820416900 + 37187201693161 = 8540130^2 + 6098131^2 .

It is a cyclic number.

It is not a de Polignac number, because 110121022110061 - 213 = 110121022101869 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110121022110061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 19.

Adding to 110121022110061 its reverse (160011220121011), we get a palindrome (270132242231072).

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