Search a number
-
+
1305235224361 is a prime number
BaseRepresentation
bin10010111111100110000…
…101001111011100101001
311121210001002100101221201
4102333212011033130221
5132341110204134421
62435341120404201
7163204642231225
oct22774605173451
94553032311851
101305235224361
114636022907a2
12190b68776661
13961108c4233
144726099b785
1523e43842b91
hex12fe614f729

1305235224361 has 2 divisors, whose sum is σ = 1305235224362. Its totient is φ = 1305235224360.

The previous prime is 1305235224289. The next prime is 1305235224389. The reversal of 1305235224361 is 1634225325031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1074301155225 + 230934069136 = 1036485^2 + 480556^2 .

It is a cyclic number.

It is not a de Polignac number, because 1305235224361 - 217 = 1305235093289 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1305235224361.

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

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

Almost surely, 21305235224361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 129600, while the sum is 37.

The spelling of 1305235224361 in words is "one trillion, three hundred five billion, two hundred thirty-five million, two hundred twenty-four thousand, three hundred sixty-one".