Search a number
-
+
110101000994993 is a prime number
BaseRepresentation
bin11001000010001011100011…
…000011011100000010110001
3112102211112221001201221100102
4121002023203003130002301
5103412343322223314433
61030055411313402145
732122351305022031
oct3102134303340261
9472745831657312
10110101000994993
1132099632809688
121042238a569355
1349586312a8c18
141d28cb9ccb8c1
15cadea67784e8
hex6422e30dc0b1

110101000994993 has 2 divisors, whose sum is σ = 110101000994994. Its totient is φ = 110101000994992.

The previous prime is 110101000994989. The next prime is 110101000995053. The reversal of 110101000994993 is 399499000101011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107751209387584 + 2349791607409 = 10380328^2 + 1532903^2 .

It is a cyclic number.

It is not a de Polignac number, because 110101000994993 - 22 = 110101000994989 is a prime.

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

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

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

Almost surely, 2110101000994993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 78732, while the sum is 47.

The spelling of 110101000994993 in words is "one hundred ten trillion, one hundred one billion, nine hundred ninety-four thousand, nine hundred ninety-three".