Search a number
-
+
110120020991 is a prime number
BaseRepresentation
bin110011010001110101…
…0100010101111111111
3101112020110020200012222
41212203222202233333
53301011211132431
6122331034115555
710645606506611
oct1464352425777
9345213220188
10110120020991
1142779976712
1219412b7bbbb
13a4cc330546
145489106db1
152ce790457b
hex19a3aa2bff

110120020991 has 2 divisors, whose sum is σ = 110120020992. Its totient is φ = 110120020990.

The previous prime is 110120020979. The next prime is 110120020999. The reversal of 110120020991 is 199020021011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110120020991 - 210 = 110120019967 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2110120020991 is an apocalyptic number.

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

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

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

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

It can be divided in two parts, 110120020 and 991, that added together give a palindrome (110121011).

The spelling of 110120020991 in words is "one hundred ten billion, one hundred twenty million, twenty thousand, nine hundred ninety-one".