Search a number
-
+
10110100110133 is a prime number
BaseRepresentation
bin1001001100011111000011…
…1011001111101100110101
31022210111221021000100111011
42103013300323033230311
52311120441112011013
633300303232312221
72062300464006112
oct223076073175465
938714837010434
1010110100110133
11324873aa40381
1211734a40a2671
135844bc30709a
1426d48d731909
15127ec0c12c3d
hex931f0ecfb35

10110100110133 has 2 divisors, whose sum is σ = 10110100110134. Its totient is φ = 10110100110132.

The previous prime is 10110100110059. The next prime is 10110100110169. The reversal of 10110100110133 is 33101100101101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9892144651684 + 217955458449 = 3145178^2 + 466857^2 .

It is a cyclic number.

It is not a de Polignac number, because 10110100110133 - 241 = 7911076854581 is a prime.

It is a super-2 number, since 2×101101001101332 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 210110100110133 is an apocalyptic number.

It is an amenable number.

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

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

10110100110133 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 13.

Adding to 10110100110133 its reverse (33101100101101), we get a palindrome (43211200211234).

The spelling of 10110100110133 in words is "ten trillion, one hundred ten billion, one hundred million, one hundred ten thousand, one hundred thirty-three".