Search a number
-
+
110102121971 is a prime number
BaseRepresentation
bin110011010001010011…
…0010000110111110011
3101112012012120022101022
41212202212100313303
53300442120400341
6122325154330055
710645301411102
oct1464246206763
9345165508338
10110102121971
114276a860936
1219408b8992b
13a4c87044ca
1454869a8039
152ce606ae4b
hex19a2990df3

110102121971 has 2 divisors, whose sum is σ = 110102121972. Its totient is φ = 110102121970.

The previous prime is 110102121949. The next prime is 110102121977. The reversal of 110102121971 is 179121201011.

It is a strong prime.

It is an emirp because it is prime and its reverse (179121201011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110102121971 - 26 = 110102121907 is a prime.

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

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

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

Almost surely, 2110102121971 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 26.

Adding to 110102121971 its reverse (179121201011), we get a palindrome (289223322982).

The spelling of 110102121971 in words is "one hundred ten billion, one hundred two million, one hundred twenty-one thousand, nine hundred seventy-one".