Search a number
-
+
103234140203057 is a prime number
BaseRepresentation
bin10111011110010000010010…
…010000010110100000110001
3111112112002100201200111111022
4113132100102100112200301
5102012342004342444212
61003321035335225225
730513264142243133
oct2736202220264061
9445462321614438
10103234140203057
112a9913979219a6
12b6b3574818215
13457ac2602a3a6
141b6c7b8043053
15be05547cd772
hex5de412416831

103234140203057 has 2 divisors, whose sum is σ = 103234140203058. Its totient is φ = 103234140203056.

The previous prime is 103234140202951. The next prime is 103234140203093. The reversal of 103234140203057 is 750302041432301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82009976836096 + 21224163366961 = 9055936^2 + 4606969^2 .

It is a cyclic number.

It is not a de Polignac number, because 103234140203057 - 216 = 103234140137521 is a prime.

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

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

Almost surely, 2103234140203057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 103234140203057 its reverse (750302041432301), we get a palindrome (853536181635358).

The spelling of 103234140203057 in words is "one hundred three trillion, two hundred thirty-four billion, one hundred forty million, two hundred three thousand, fifty-seven".