Search a number
-
+
101000110147 is a prime number
BaseRepresentation
bin101111000010000010…
…0110110000001000011
3100122200212112012110021
41132010010312001003
53123322012011042
6114222050514311
710203606525346
oct1360404660103
9318625465407
10101000110147
1139919a24712
12176a8895997
1396a7a87ab1
144c61bda45d
152961e3d867
hex1784136043

101000110147 has 2 divisors, whose sum is σ = 101000110148. Its totient is φ = 101000110146.

The previous prime is 101000110109. The next prime is 101000110163. The reversal of 101000110147 is 741011000101.

It is a happy number.

It is an a-pointer prime, because the next prime (101000110163) can be obtained adding 101000110147 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101000110147 - 27 = 101000110019 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 101000110147.

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

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

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

Almost surely, 2101000110147 is an apocalyptic number.

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

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

101000110147 is an evil number, because the sum of its binary digits is even.

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

Adding to 101000110147 its reverse (741011000101), we get a palindrome (842011110248).

The spelling of 101000110147 in words is "one hundred one billion, one hundred ten thousand, one hundred forty-seven".