Search a number
-
+
105530004113 is a prime number
BaseRepresentation
bin110001001001000010…
…1000001001010010001
3101002101120022122202212
41202102011001022101
53212111140112423
6120251350121505
710424063143322
oct1422205011221
9332346278685
10105530004113
1140833a33036
1218551950295
139c4a3ca221
145171688449
152b29984578
hex1892141291

105530004113 has 2 divisors, whose sum is σ = 105530004114. Its totient is φ = 105530004112.

The previous prime is 105530004031. The next prime is 105530004131. The reversal of 105530004113 is 311400035501.

Together with next prime (105530004131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 53579286784 + 51950717329 = 231472^2 + 227927^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-105530004113 is a prime.

It is a super-2 number, since 2×1055300041132 (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2105530004113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 23.

Adding to 105530004113 its reverse (311400035501), we get a palindrome (416930039614).

The spelling of 105530004113 in words is "one hundred five billion, five hundred thirty million, four thousand, one hundred thirteen".