Search a number
-
+
1000331330981 is a prime number
BaseRepresentation
bin11101000111010000110…
…01001100010110100101
310112122000210212210010212
432203220121030112211
5112342134310042411
62043313524025205
7132162100006403
oct16435031142645
93478023783125
101000331330981
11356268a59854
12141a54b32205
137343bb16388
14365b8454473
151b04a8b368b
hexe8e864c5a5

1000331330981 has 2 divisors, whose sum is σ = 1000331330982. Its totient is φ = 1000331330980.

The previous prime is 1000331330881. The next prime is 1000331331011. The reversal of 1000331330981 is 1890331330001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 741648216100 + 258683114881 = 861190^2 + 508609^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000331330981 - 210 = 1000331329957 is a prime.

It is a super-2 number, since 2×10003313309812 (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 (1000331330881) by changing a digit.

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

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

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

Almost surely, 21000331330981 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1000331330981 its reverse (1890331330001), we get a palindrome (2890662660982).

The spelling of 1000331330981 in words is "one trillion, three hundred thirty-one million, three hundred thirty thousand, nine hundred eighty-one".