Search a number
-
+
103011132110093 is a prime number
BaseRepresentation
bin10111011011000000100101…
…111011111111010100001101
3111111201202201220121120221122
4113123000211323333110031
5102000213244310010333
61003030354422010325
730461210611601654
oct2733004573772415
9444652656546848
10103011132110093
112a905859643a39
12b6782b78769a5
134562ba607752c
141b61aa036819b
15bd985149b798
hex5db025eff50d

103011132110093 has 2 divisors, whose sum is σ = 103011132110094. Its totient is φ = 103011132110092.

The previous prime is 103011132110053. The next prime is 103011132110129. The reversal of 103011132110093 is 390011231110301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84712474707844 + 18298657402249 = 9203938^2 + 4277693^2 .

It is a cyclic number.

It is not a de Polignac number, because 103011132110093 - 224 = 103011115332877 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2103011132110093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 26.

Adding to 103011132110093 its reverse (390011231110301), we get a palindrome (493022363220394).

The spelling of 103011132110093 in words is "one hundred three trillion, eleven billion, one hundred thirty-two million, one hundred ten thousand, ninety-three".