Search a number
-
+
103100566253 is a prime number
BaseRepresentation
bin110000000000101000…
…1011100101011101101
3100212010020220102112212
41200001101130223231
53142122221110003
6115210322540205
710306633232156
oct1400121345355
9325106812485
10103100566253
113a7a7644453
1217b94207665
139950ca5429
144dc0b6492d
152a36545dd8
hex180145caed

103100566253 has 2 divisors, whose sum is σ = 103100566254. Its totient is φ = 103100566252.

The previous prime is 103100566211. The next prime is 103100566277. The reversal of 103100566253 is 352665001301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102616434244 + 484132009 = 320338^2 + 22003^2 .

It is an emirp because it is prime and its reverse (352665001301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 103100566253 - 210 = 103100565229 is a prime.

It is a super-3 number, since 3×1031005662533 (a number of 34 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2103100566253 is an apocalyptic number.

It is an amenable number.

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

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

103100566253 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 16200, while the sum is 32.

Adding to 103100566253 its reverse (352665001301), we get a palindrome (455765567554).

The spelling of 103100566253 in words is "one hundred three billion, one hundred million, five hundred sixty-six thousand, two hundred fifty-three".