Search a number
-
+
12121111020091 is a prime number
BaseRepresentation
bin1011000001100010101010…
…0001000100001000111011
31120220202201001211101100011
42300120222201010020323
53042043013410120331
641440210031322351
72360502300466363
oct260305241041073
946822631741304
1012121111020091
1139535971a0847
12143919b6803b7
1369c028b15898
142dc9446d19a3
151604706d73b1
hexb062a84423b

12121111020091 has 2 divisors, whose sum is σ = 12121111020092. Its totient is φ = 12121111020090.

The previous prime is 12121111020071. The next prime is 12121111020113. The reversal of 12121111020091 is 19002011112121.

It is a happy number.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 12121111020091 - 29 = 12121111019579 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 212121111020091 is an apocalyptic number.

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

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

12121111020091 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 12121111020091 in words is "twelve trillion, one hundred twenty-one billion, one hundred eleven million, twenty thousand, ninety-one".