Search a number
-
+
1005331210393 is a prime number
BaseRepresentation
bin11101010000100100110…
…10001110000010011001
310120002221021000222021211
432220102122032002121
5112432404242213033
62045502012503121
7132430021202326
oct16502232160231
93502837028254
101005331210393
113583a42941a4
12142a0b47aaa1
1373a579320c3
14369304c3b4d
151b23e7e42cd
hexea1268e099

1005331210393 has 2 divisors, whose sum is σ = 1005331210394. Its totient is φ = 1005331210392.

The previous prime is 1005331210361. The next prime is 1005331210399. The reversal of 1005331210393 is 3930121335001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 857081569369 + 148249641024 = 925787^2 + 385032^2 .

It is an emirp because it is prime and its reverse (3930121335001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1005331210393 - 25 = 1005331210361 is a prime.

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

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

Almost surely, 21005331210393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7290, while the sum is 31.

Adding to 1005331210393 its reverse (3930121335001), we get a palindrome (4935452545394).

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