Search a number
-
+
103332011331023 is a prime number
BaseRepresentation
bin10111011111101011011011…
…110101000100110111001111
3111112212102222112110221022122
4113133223123311010313033
5102020442424400043043
61003434023133203155
730523330366144466
oct2737533365046717
9445772875427278
10103332011331023
112aa19950599a22
12b70a5296304bb
134587222780527
141b7342045d9dd
15be2d81b9b368
hex5dfadbd44dcf

103332011331023 has 2 divisors, whose sum is σ = 103332011331024. Its totient is φ = 103332011331022.

The previous prime is 103332011330953. The next prime is 103332011331041. The reversal of 103332011331023 is 320133110233301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 103332011331023 - 220 = 103332010282447 is a prime.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2103332011331023 is an apocalyptic number.

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

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

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

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

Adding to 103332011331023 its reverse (320133110233301), we get a palindrome (423465121564324).

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