Search a number
-
+
10111133023309 is a prime number
BaseRepresentation
bin1001001100100010111001…
…1111011111110001001101
31022210121121020121202222201
42103020232133133301031
52311130100023221214
633300553531241501
72062335205430563
oct223105637376115
938717536552881
1010111133023309
11324911aaa432a
121173731ba9291
135846252c9206
1426d54a9a9a33
15128031746274
hex9322e7dfc4d

10111133023309 has 2 divisors, whose sum is σ = 10111133023310. Its totient is φ = 10111133023308.

The previous prime is 10111133023301. The next prime is 10111133023337. The reversal of 10111133023309 is 90332033111101.

It is an a-pointer prime, because the next prime (10111133023337) can be obtained adding 10111133023309 to its sum of digits (28).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5899288034025 + 4211844989284 = 2428845^2 + 2052278^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111133023309 - 23 = 10111133023301 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210111133023309 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 28.

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