Search a number
-
+
1410093263251 is a prime number
BaseRepresentation
bin10100100001010000000…
…110111010100110010011
311222210200211020200201201
4110201100012322212103
5141100332333411001
62555442104212031
7203606265655351
oct24412006724623
94883624220651
101410093263251
114a4020982372
121a935146a017
13a2c81a196aa
144c36acc87d1
1526a2e2e1501
hex148501ba993

1410093263251 has 2 divisors, whose sum is σ = 1410093263252. Its totient is φ = 1410093263250.

The previous prime is 1410093263239. The next prime is 1410093263317. The reversal of 1410093263251 is 1523623900141.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1410093263251 - 213 = 1410093255059 is a prime.

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

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

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

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

Almost surely, 21410093263251 is an apocalyptic number.

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

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

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

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

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