Search a number
-
+
101320133030189 is a prime number
BaseRepresentation
bin10111000010011001101110…
…100010011011000100101101
3111021202002222021111212212122
4113002121232202123010231
5101240012113023431224
6555253454311042325
730225065230561643
oct2702315642330455
9437662867455778
10101320133030189
112a313699759997
12b44462b6703a5
13446c5a8354aa8
141b03cc61d1193
15baa880e8c15e
hex5c266e89b12d

101320133030189 has 2 divisors, whose sum is σ = 101320133030190. Its totient is φ = 101320133030188.

The previous prime is 101320133030107. The next prime is 101320133030209. The reversal of 101320133030189 is 981030331023101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100926335364100 + 393797666089 = 10046210^2 + 627533^2 .

It is a cyclic number.

It is not a de Polignac number, because 101320133030189 - 228 = 101319864594733 is a prime.

It is a congruent number.

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

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

Almost surely, 2101320133030189 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101320133030189 in words is "one hundred one trillion, three hundred twenty billion, one hundred thirty-three million, thirty thousand, one hundred eighty-nine".