Search a number
-
+
1012220300197 is a prime number
BaseRepresentation
bin11101011101011010000…
…10000000101110100101
310120202201101001222220001
432232231002000232211
5113041011344101242
62053001345541301
7133062522406261
oct16565502005645
93522641058801
101012220300197
11360309a75347
12144212644831
13745b4c745c2
1436dc540d0a1
151b4e4500eb7
hexebad080ba5

1012220300197 has 2 divisors, whose sum is σ = 1012220300198. Its totient is φ = 1012220300196.

The previous prime is 1012220300177. The next prime is 1012220300227. The reversal of 1012220300197 is 7910030222101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 995107997601 + 17112302596 = 997551^2 + 130814^2 .

It is a cyclic number.

It is not a de Polignac number, because 1012220300197 - 235 = 977860561829 is a prime.

It is a super-2 number, since 2×10122203001972 (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 (1012220300167) by changing a digit.

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

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

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

Almost surely, 21012220300197 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1012220300197 its reverse (7910030222101), we get a palindrome (8922250522298).

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