Search a number
-
+
110010000010093 is a prime number
BaseRepresentation
bin11001000000110110110010…
…111110001110101101101101
3112102111212001001022221002021
4121000312302332032231231
5103404400440000310333
61025545521334430141
732112650232303121
oct3100666276165555
9472455031287067
10110010000010093
1132063a85061847
1210408812502351
13494cb8ac933b1
141d247260a7581
15cab92c5c382d
hex640db2f8eb6d

110010000010093 has 2 divisors, whose sum is σ = 110010000010094. Its totient is φ = 110010000010092.

The previous prime is 110010000010087. The next prime is 110010000010109. The reversal of 110010000010093 is 390010000010011.

It is a happy number.

It is an a-pointer prime, because the next prime (110010000010109) can be obtained adding 110010000010093 to its sum of digits (16).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 84127821982884 + 25882178027209 = 9172122^2 + 5087453^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 110010000010093 - 213 = 110010000001901 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110010000010093 is an apocalyptic number.

It is an amenable number.

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

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

110010000010093 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 27, while the sum is 16.

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