Search a number
-
+
103214145305213 is a prime number
BaseRepresentation
bin10111011101111101101010…
…011101110111101001111101
3111112110011202020202110002022
4113131331222131313221331
5102012030032144231323
61003303531311205525
730511655511356255
oct2735755235675175
9445404666673068
10103214145305213
112a983967268238
12b6ab7145168a5
13457908a71aba7
141b6b83c6c8965
15bdec8421e4c8
hex5ddf6a777a7d

103214145305213 has 2 divisors, whose sum is σ = 103214145305214. Its totient is φ = 103214145305212.

The previous prime is 103214145305191. The next prime is 103214145305221. The reversal of 103214145305213 is 312503541412301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87417320176729 + 15796825128484 = 9349723^2 + 3974522^2 .

It is a cyclic number.

It is not a de Polignac number, because 103214145305213 - 26 = 103214145305149 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2103214145305213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 103214145305213 its reverse (312503541412301), we get a palindrome (415717686717514).

The spelling of 103214145305213 in words is "one hundred three trillion, two hundred fourteen billion, one hundred forty-five million, three hundred five thousand, two hundred thirteen".