Search a number
-
+
103011131011 is a prime number
BaseRepresentation
bin101111111101111110…
…0010001111010000011
3100211220000121122110111
41133323330101322003
53141431322143021
6115153410012151
710304466111055
oct1377374217203
9324800548414
10103011131011
113a761109428
1217b6a277057
1399385c0579
144db2d238d5
152a2d77b8e1
hex17fbf11e83

103011131011 has 2 divisors, whose sum is σ = 103011131012. Its totient is φ = 103011131010.

The previous prime is 103011130919. The next prime is 103011131053. The reversal of 103011131011 is 110131110301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 103011131011 - 29 = 103011130499 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 103011130982 and 103011131000.

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

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

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

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

Almost surely, 2103011131011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 103011131011 its reverse (110131110301), we get a palindrome (213142241312).

The spelling of 103011131011 in words is "one hundred three billion, eleven million, one hundred thirty-one thousand, eleven".