Search a number
-
+
102000313147 is a prime number
BaseRepresentation
bin101111011111110110…
…0010100001100111011
3100202021120120210000211
41132333230110030323
53132344040010042
6114505220411551
710240443233155
oct1367754241473
9322246523024
10102000313147
113a292576a67
1217927846bb7
1398070664a5
144d1899bad5
1529beb60017
hex17bfb1433b

102000313147 has 2 divisors, whose sum is σ = 102000313148. Its totient is φ = 102000313146.

The previous prime is 102000313117. The next prime is 102000313169. The reversal of 102000313147 is 741313000201.

It is an a-pointer prime, because the next prime (102000313169) can be obtained adding 102000313147 to its sum of digits (22).

It is a strong prime.

It is a cyclic number.

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

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

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

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

Almost surely, 2102000313147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 504, while the sum is 22.

Adding to 102000313147 its reverse (741313000201), we get a palindrome (843313313348).

The spelling of 102000313147 in words is "one hundred two billion, three hundred thirteen thousand, one hundred forty-seven".