Search a number
-
+
103314146057 is a prime number
BaseRepresentation
bin110000000111000000…
…0001100001100001001
3100212200010210101221222
41200032000030030021
53143041410133212
6115243432411425
710315135515623
oct1401600141411
9325603711858
10103314146057
113a8a7162091
1218033846b75
139986305805
14500127dc13
152a4a183c72
hex180e00c309

103314146057 has 2 divisors, whose sum is σ = 103314146058. Its totient is φ = 103314146056.

The previous prime is 103314146017. The next prime is 103314146077. The reversal of 103314146057 is 750641413301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76542968896 + 26771177161 = 276664^2 + 163619^2 .

It is a cyclic number.

It is not a de Polignac number, because 103314146057 - 28 = 103314145801 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2103314146057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 103314146057 its reverse (750641413301), we get a palindrome (853955559358).

The spelling of 103314146057 in words is "one hundred three billion, three hundred fourteen million, one hundred forty-six thousand, fifty-seven".