Search a number
-
+
100110100110133 is a prime number
BaseRepresentation
bin10110110000110010110010…
…111101001001101100110101
3111010110102200000002121221111
4112300302302331021230311
5101110200441112011013
6552525540050115021
730041500414504051
oct2660626275115465
9433412600077844
10100110100110133
1129997500713533
12b28a011b7ba71
1343b245a2c47c9
141aa14d7414c61
15b8916058e73d
hex5b0cb2f49b35

100110100110133 has 2 divisors, whose sum is σ = 100110100110134. Its totient is φ = 100110100110132.

The previous prime is 100110100110067. The next prime is 100110100110173. The reversal of 100110100110133 is 331011001011001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 86390202604689 + 13719897505444 = 9294633^2 + 3704038^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2100110100110133 is an apocalyptic number.

It is an amenable number.

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

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

100110100110133 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 100110100110133 its reverse (331011001011001), we get a palindrome (431121101121134).

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