Search a number
-
+
1103304101989 is a prime number
BaseRepresentation
bin10000000011100010000…
…011001001000001100101
310220110211011022112120111
4100003202003021001211
5121034031322230424
62202503443533021
7142465622062645
oct20034203110145
93813734275514
101103304101989
113959aa4477a1
121599b238a171
138006c4956cb
143b586230525
151da75ab4194
hex100e20c9065

1103304101989 has 2 divisors, whose sum is σ = 1103304101990. Its totient is φ = 1103304101988.

The previous prime is 1103304101941. The next prime is 1103304102013. The reversal of 1103304101989 is 9891014033011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1089372312900 + 13931789089 = 1043730^2 + 118033^2 .

It is a cyclic number.

It is not a de Polignac number, because 1103304101989 - 213 = 1103304093797 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21103304101989 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 40.

The spelling of 1103304101989 in words is "one trillion, one hundred three billion, three hundred four million, one hundred one thousand, nine hundred eighty-nine".