Search a number
-
+
1012203313021 is a prime number
BaseRepresentation
bin11101011101011000000…
…01001101011101111101
310120202200012002221212101
432232230001031131331
5113040443022004041
62052555541505101
7133062225126055
oct16565401153575
93522605087771
101012203313021
1136030042265a
12144208a12191
13745b15a7614
1436dc306a565
151b4e2c97b31
hexebac04d77d

1012203313021 has 2 divisors, whose sum is σ = 1012203313022. Its totient is φ = 1012203313020.

The previous prime is 1012203313013. The next prime is 1012203313073. The reversal of 1012203313021 is 1203133022101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 996223572100 + 15979740921 = 998110^2 + 126411^2 .

It is a cyclic number.

It is not a de Polignac number, because 1012203313021 - 23 = 1012203313013 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1012203313621) 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, 506101656510 + 506101656511.

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

Almost surely, 21012203313021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 19.

Adding to 1012203313021 its reverse (1203133022101), we get a palindrome (2215336335122).

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