Search a number
-
+
100105061050153 is a prime number
BaseRepresentation
bin10110110000101110000110…
…100110101010011100101001
3111010102221122211012212011101
4112300232012212222130221
5101110110131112101103
6552523344041401401
730041231506265065
oct2660560646523451
9433387584185141
10100105061050153
1129995355258155
12b289046499261
1343b1b3633b203
141aa117a0a6aa5
15b88e67ebea1d
hex5b0b869aa729

100105061050153 has 2 divisors, whose sum is σ = 100105061050154. Its totient is φ = 100105061050152.

The previous prime is 100105061050097. The next prime is 100105061050171. The reversal of 100105061050153 is 351050160501001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77367012405904 + 22738048644249 = 8795852^2 + 4768443^2 .

It is a cyclic number.

It is not a de Polignac number, because 100105061050153 - 229 = 100104524179241 is a prime.

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

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

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

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

Almost surely, 2100105061050153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2250, while the sum is 28.

The spelling of 100105061050153 in words is "one hundred trillion, one hundred five billion, sixty-one million, fifty thousand, one hundred fifty-three".