Search a number
-
+
1030303013321 is a prime number
BaseRepresentation
bin11101111111000101101…
…10000101100111001001
310122111101120212222222202
432333202312011213021
5113340030032411241
62105151545125545
7134302604054441
oct16774266054711
93574346788882
101030303013321
11367a4921135a
1214781a4898b5
137620737515a
1437c1cc0b121
151bc01c96d9b
hexefe2d859c9

1030303013321 has 2 divisors, whose sum is σ = 1030303013322. Its totient is φ = 1030303013320.

The previous prime is 1030303013297. The next prime is 1030303013329. The reversal of 1030303013321 is 1233103030301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 772528492096 + 257774521225 = 878936^2 + 507715^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 1030303013293 and 1030303013302.

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

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

Almost surely, 21030303013321 is an apocalyptic number.

It is an amenable number.

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

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

1030303013321 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 20.

Adding to 1030303013321 its reverse (1233103030301), we get a palindrome (2263406043622).

The spelling of 1030303013321 in words is "one trillion, thirty billion, three hundred three million, thirteen thousand, three hundred twenty-one".