Search a number
-
+
103011100031011 is a prime number
BaseRepresentation
bin10111011011000000100100…
…000001100111100000100011
3111111201202122200020210201111
4113123000210001213200203
5102000213213101443021
61003030351314244151
730461210042123644
oct2733004401474043
9444652580223644
10103011100031011
112a9058425234a7
12b6782a8b86657
134562b9c525123
141b61a99db76cb
15bd984d7618e1
hex5db024067823

103011100031011 has 2 divisors, whose sum is σ = 103011100031012. Its totient is φ = 103011100031010.

The previous prime is 103011100030991. The next prime is 103011100031033. The reversal of 103011100031011 is 110130001110301.

It is a weak prime.

It is a cyclic number.

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

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

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

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

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

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

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

Almost surely, 2103011100031011 is an apocalyptic number.

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

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

103011100031011 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 103011100031011 its reverse (110130001110301), we get a palindrome (213141101141312).

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