Search a number
-
+
101221101020009 is a prime number
BaseRepresentation
bin10111000000111101011111…
…110001010010001101101001
3111021101122100120022112000202
4113000331133301102031221
5101231401303330120014
6555140155403241545
730214661146434125
oct2700753761221551
9437348316275022
10101221101020009
112a28569a773983
12b4293b1b192b5
1344631552555b9
141add1ad948585
15ba7ed6c0e3de
hex5c0f5fc52369

101221101020009 has 2 divisors, whose sum is σ = 101221101020010. Its totient is φ = 101221101020008.

The previous prime is 101221101019967. The next prime is 101221101020029. The reversal of 101221101020009 is 900020101122101.

It is an a-pointer prime, because the next prime (101221101020029) can be obtained adding 101221101020009 to its sum of digits (20).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96530723250025 + 4690377769984 = 9825005^2 + 2165728^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101221101020009 is a prime.

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

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

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

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

Almost surely, 2101221101020009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 20.

The spelling of 101221101020009 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred one million, twenty thousand, nine".