Search a number
-
+
10501965413 is a prime number
BaseRepresentation
bin10011100011111011…
…10100011001100101
31000002220022010012222
421301331310121211
5133002000343123
64454033322125
7521151142652
oct116175643145
930086263188
1010501965413
1144aa0a4065
122051106345
13cb49b0024
14718aaac29
15416eb36c8
hex271f74665

10501965413 has 2 divisors, whose sum is σ = 10501965414. Its totient is φ = 10501965412.

The previous prime is 10501965391. The next prime is 10501965421. The reversal of 10501965413 is 31456910501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10164067489 + 337897924 = 100817^2 + 18382^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10501965413 - 218 = 10501703269 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10501965433) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5250982706 + 5250982707.

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

Almost surely, 210501965413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16200, while the sum is 35.

The spelling of 10501965413 in words is "ten billion, five hundred one million, nine hundred sixty-five thousand, four hundred thirteen".