Search a number
-
+
1101103133309 is a prime number
BaseRepresentation
bin10000000001011110110…
…111000111001001111101
310220021010202210202010222
4100001132313013021331
5121020024400231214
62201501221311125
7142360235130434
oct20013667071175
93807122722128
101101103133309
11394a80016413
121594992654a5
137caab4b518a
143b417bc011b
151d99775538e
hex1005edc727d

1101103133309 has 2 divisors, whose sum is σ = 1101103133310. Its totient is φ = 1101103133308.

The previous prime is 1101103133297. The next prime is 1101103133311. The reversal of 1101103133309 is 9033313011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 708832654084 + 392270479225 = 841922^2 + 626315^2 .

It is a cyclic number.

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

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

Together with 1101103133311, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21101103133309 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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