Search a number
-
+
2003093681 is a prime number
BaseRepresentation
bin111011101100100…
…1100100010110001
312011121011200221212
41313121030202301
513100242444211
6530433125505
7100432005161
oct16731144261
95147150855
102003093681
1193876aa26
1247a9b9895
1325bcbb544
141500625a1
15bacc438b
hex7764c8b1

2003093681 has 2 divisors, whose sum is σ = 2003093682. Its totient is φ = 2003093680.

The previous prime is 2003093567. The next prime is 2003093683. The reversal of 2003093681 is 1863903002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1324960000 + 678133681 = 36400^2 + 26041^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×20030936812 = 8024768589724259522, which contains 22 as substring.

Together with 2003093683, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 22003093681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7776, while the sum is 32.

The square root of 2003093681 is about 44755.9345897279. The cubic root of 2003093681 is about 1260.5703475255.

Adding to 2003093681 its reverse (1863903002), we get a palindrome (3866996683).

The spelling of 2003093681 in words is "two billion, three million, ninety-three thousand, six hundred eighty-one".