101120021969 has 2 divisors, whose sum is σ = 101120021970. Its totient is φ = 101120021968.

The previous prime is 101120021957. The next prime is 101120022001. The reversal of 101120021969 is 969120021101.

It is an a-pointer prime, because the next prime (101120022001) can be obtained adding 101120021969 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98933524369 + 2186497600 = 314537^2 + 46760^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×101120021969² (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2^101120021969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 32.

The spelling of 101120021969 in words is "one hundred one billion, one hundred twenty million, twenty-one thousand, nine hundred sixty-nine".