Search a number
-
+
10003313032291 is a prime number
BaseRepresentation
bin1001000110010001001111…
…1010110111110001100011
31022102022022002021201202001
42101210103322313301203
52302343241114013131
633135243014504431
72051500264555465
oct221442372676143
938368262251661
1010003313032291
11320742146a237
121156861365117
13577401651667
1426823d13c135
15125320c1c261
hex91913eb7c63

10003313032291 has 2 divisors, whose sum is σ = 10003313032292. Its totient is φ = 10003313032290.

The previous prime is 10003313032261. The next prime is 10003313032319. The reversal of 10003313032291 is 19223031330001.

It is an a-pointer prime, because the next prime (10003313032319) can be obtained adding 10003313032291 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10003313032291 - 213 = 10003313024099 is a prime.

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

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

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

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

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

Almost surely, 210003313032291 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2916, while the sum is 28.

Adding to 10003313032291 its reverse (19223031330001), we get a palindrome (29226344362292).

The spelling of 10003313032291 in words is "ten trillion, three billion, three hundred thirteen million, thirty-two thousand, two hundred ninety-one".