Search a number
-
+
10201012021201 is a prime number
BaseRepresentation
bin1001010001110001101110…
…1100101010011111010001
31100010012121001210221102111
42110130123230222133101
52314113133034134301
633410140310145321
72101666405340401
oct224343354523721
940105531727374
1010201012021201
113283252389781
121189036352241
1358cc4a0333c1
14273a357aa801
1512a542170551
hex9471bb2a7d1

10201012021201 has 2 divisors, whose sum is σ = 10201012021202. Its totient is φ = 10201012021200.

The previous prime is 10201012021181. The next prime is 10201012021219. The reversal of 10201012021201 is 10212021010201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10200364827601 + 647193600 = 3193801^2 + 25440^2 .

It is a cyclic number.

It is not a de Polignac number, because 10201012021201 - 243 = 1404918998993 is a prime.

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

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

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

Almost surely, 210201012021201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 10201012021201 its reverse (10212021010201), we get a palindrome (20413033031402).

The spelling of 10201012021201 in words is "ten trillion, two hundred one billion, twelve million, twenty-one thousand, two hundred one".