Search a number
-
+
106910045153 is a prime number
BaseRepresentation
bin110001110010001010…
…1011101001111100001
3101012221202010000011222
41203210111131033201
53222422432421103
6121040325144425
710503221250512
oct1434425351741
9335852100158
10106910045153
1141381a2a31a
1218877b5b115
13a10a2ab162
145262a82a09
152baabd5638
hex18e455d3e1

106910045153 has 2 divisors, whose sum is σ = 106910045154. Its totient is φ = 106910045152.

The previous prime is 106910045131. The next prime is 106910045167. The reversal of 106910045153 is 351540019601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68724195409 + 38185849744 = 262153^2 + 195412^2 .

It is a cyclic number.

It is not a de Polignac number, because 106910045153 - 236 = 38190568417 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (106910045183) 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, 53455022576 + 53455022577.

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

Almost surely, 2106910045153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16200, while the sum is 35.

The spelling of 106910045153 in words is "one hundred six billion, nine hundred ten million, forty-five thousand, one hundred fifty-three".