Search a number
-
+
1303303201997 is a prime number
BaseRepresentation
bin10010111101110010111…
…011001010010011001101
311121121001102220111111212
4102331302323022103031
5132323131104430442
62434421302424205
7163106032301036
oct22756273122315
94547042814455
101303303201997
114628007537a5
12190709732065
1395b9355b034
144711a159a8d
1523d7de0ba82
hex12f72eca4cd

1303303201997 has 2 divisors, whose sum is σ = 1303303201998. Its totient is φ = 1303303201996.

The previous prime is 1303303201979. The next prime is 1303303202041. The reversal of 1303303201997 is 7991023033031.

Together with previous prime (1303303201979) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1029780477961 + 273522724036 = 1014781^2 + 522994^2 .

It is a cyclic number.

It is not a de Polignac number, because 1303303201997 - 210 = 1303303200973 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 21303303201997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 91854, while the sum is 41.

The spelling of 1303303201997 in words is "one trillion, three hundred three billion, three hundred three million, two hundred one thousand, nine hundred ninety-seven".