Search a number
-
+
103320012331057 is a prime number
BaseRepresentation
bin10111011111100000010000…
…101000100001100000110001
3111112211022000022020120202111
4113133200100220201200301
5102020243341124043212
61003424320341045321
730522424136264344
oct2737402050414061
9445738008216674
10103320012331057
112aa14853460725
12b70813b0b6841
13458605c8a8c52
141b72a02a2245b
15be28cd576ea7
hex5df810a21831

103320012331057 has 2 divisors, whose sum is σ = 103320012331058. Its totient is φ = 103320012331056.

The previous prime is 103320012330959. The next prime is 103320012331069. The reversal of 103320012331057 is 750133210023301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 75864256780081 + 27455755550976 = 8710009^2 + 5239824^2 .

It is a cyclic number.

It is not a de Polignac number, because 103320012331057 - 239 = 102770256517169 is a prime.

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

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

Almost surely, 2103320012331057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 31.

Adding to 103320012331057 its reverse (750133210023301), we get a palindrome (853453222354358).

The spelling of 103320012331057 in words is "one hundred three trillion, three hundred twenty billion, twelve million, three hundred thirty-one thousand, fifty-seven".