Search a number
-
+
101102012147 is a prime number
BaseRepresentation
bin101111000101000100…
…1100100011011110011
3100122221222021100201102
41132022021210123303
53124024103342042
6114240130555015
710206254631623
oct1361211443363
9318858240642
10101102012147
11399714a5144
1217716a38a6b
1396c2c16236
144c71564883
15296ad6bb32
hex178a2646f3

101102012147 has 2 divisors, whose sum is σ = 101102012148. Its totient is φ = 101102012146.

The previous prime is 101102012119. The next prime is 101102012153. The reversal of 101102012147 is 741210201101.

It is a strong prime.

It is a cyclic number.

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

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

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

Almost surely, 2101102012147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 112, while the sum is 20.

Adding to 101102012147 its reverse (741210201101), we get a palindrome (842312213248).

The spelling of 101102012147 in words is "one hundred one billion, one hundred two million, twelve thousand, one hundred forty-seven".