Search a number
-
+
1110131101309 is a prime number
BaseRepresentation
bin10000001001111000111…
…110000100111001111101
310221010102221112001001011
4100021320332010321331
5121142022030220214
62205553122115221
7143130040445026
oct20117076047175
93833387461034
101110131101309
1139889307a39a
1215b1987abb11
13808b99a8589
143ba32bd5c4d
151dd25108ac4
hex10278f84e7d

1110131101309 has 2 divisors, whose sum is σ = 1110131101310. Its totient is φ = 1110131101308.

The previous prime is 1110131101301. The next prime is 1110131101333. The reversal of 1110131101309 is 9031011310111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1040559126084 + 69571975225 = 1020078^2 + 263765^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110131101309 - 23 = 1110131101301 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1110131101309.

It is a congruent number.

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

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

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

Almost surely, 21110131101309 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81, while the sum is 22.

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