Search a number
-
+
200101100111993 is a prime number
BaseRepresentation
bin101101011111110110101010…
…111111011100100001111001
3222020111110220201022212202202
4231133312222333130201321
5202211424023112040433
61545325102031435545
760101553541143563
oct5537665277344171
9866443821285682
10200101100111993
115883844442a913
121a538b25685bb5
1387865b698b262
14375ad32c12333
15182014eb82ee8
hexb5fdaafdc879

200101100111993 has 2 divisors, whose sum is σ = 200101100111994. Its totient is φ = 200101100111992.

The previous prime is 200101100111963. The next prime is 200101100112031. The reversal of 200101100111993 is 399111001101002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 138805792238569 + 61295307873424 = 11781587^2 + 7829132^2 .

It is a cyclic number.

It is not a de Polignac number, because 200101100111993 - 212 = 200101100107897 is a prime.

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

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

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

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

Almost surely, 2200101100111993 is an apocalyptic number.

It is an amenable number.

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

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

200101100111993 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.

Adding to 200101100111993 its reverse (399111001101002), we get a palindrome (599212101212995).

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