Search a number
-
+
110002010111993 is a prime number
BaseRepresentation
bin11001000000101111010110…
…101111001011111111111001
3112102111002102012221001101102
4121000233112233023333321
5103404233104042040433
61025542120435301145
732112245233265426
oct3100572657137771
9472432365831342
10110002010111993
1132060654a6407a
121040716274a7b5
13494c1b687933c
141d241a8cacd4d
15cab610e214e8
hex640bd6bcbff9

110002010111993 has 2 divisors, whose sum is σ = 110002010111994. Its totient is φ = 110002010111992.

The previous prime is 110002010111971. The next prime is 110002010112019. The reversal of 110002010111993 is 399111010200011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 108075318981184 + 1926691130809 = 10395928^2 + 1388053^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110002010111993 is a prime.

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

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

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

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

Almost surely, 2110002010111993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 29.

The spelling of 110002010111993 in words is "one hundred ten trillion, two billion, ten million, one hundred eleven thousand, nine hundred ninety-three".