Search a number
-
+
1410093263239 is a prime number
BaseRepresentation
bin10100100001010000000…
…110111010100110000111
311222210200211020200201021
4110201100012322212013
5141100332333410424
62555442104212011
7203606265655333
oct24412006724607
94883624220637
101410093263239
114a4020982361
121a935146a007
13a2c81a1969b
144c36acc87c3
1526a2e2e14e4
hex148501ba987

1410093263239 has 2 divisors, whose sum is σ = 1410093263240. Its totient is φ = 1410093263238.

The previous prime is 1410093263237. The next prime is 1410093263251. The reversal of 1410093263239 is 9323623900141.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1410093263239 - 21 = 1410093263237 is a prime.

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

Together with 1410093263237, it forms a pair of twin primes.

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

It is a congruent number.

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

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

Almost surely, 21410093263239 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 209952, while the sum is 43.

The spelling of 1410093263239 in words is "one trillion, four hundred ten billion, ninety-three million, two hundred sixty-three thousand, two hundred thirty-nine".