Search a number
-
+
101001121104019 is a prime number
BaseRepresentation
bin10110111101110000100111…
…111100100000000010010011
3111020121121112210021221100211
4112331300213330200002103
5101214300244000312034
6554451135142224551
730163042636132153
oct2675604774400223
9436547483257324
10101001121104019
112a200375851114
12b3b283b125157
134448498771236
141ad26a20cc763
15ba240e689d64
hex5bdc27f20093

101001121104019 has 2 divisors, whose sum is σ = 101001121104020. Its totient is φ = 101001121104018.

The previous prime is 101001121104007. The next prime is 101001121104041. The reversal of 101001121104019 is 910401121100101.

It is an a-pointer prime, because the next prime (101001121104041) can be obtained adding 101001121104019 to its sum of digits (22).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101001121104019 - 221 = 101001119006867 is a prime.

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

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

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

Almost surely, 2101001121104019 is an apocalyptic number.

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

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

101001121104019 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 22.

The spelling of 101001121104019 in words is "one hundred one trillion, one billion, one hundred twenty-one million, one hundred four thousand, nineteen".