Search a number
-
+
1993706483981 is a prime number
BaseRepresentation
bin11101000000110010001…
…010101011000100001101
321001121002211111010000012
4131000302022223010031
5230131102324441411
64123521321043005
7264016622333612
oct35006212530415
97047084433005
101993706483981
116a9587375083
12282488326465
1311600c72abb4
146c6d2ab8509
1536cda71718b
hex1d0322ab10d

1993706483981 has 2 divisors, whose sum is σ = 1993706483982. Its totient is φ = 1993706483980.

The previous prime is 1993706483917. The next prime is 1993706483987. The reversal of 1993706483981 is 1893846073991.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1306563302500 + 687143181481 = 1143050^2 + 828941^2 .

It is a cyclic number.

It is not a de Polignac number, because 1993706483981 - 26 = 1993706483917 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21993706483981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70543872, while the sum is 68.

The spelling of 1993706483981 in words is "one trillion, nine hundred ninety-three billion, seven hundred six million, four hundred eighty-three thousand, nine hundred eighty-one".