Search a number
-
+
10412122324013 is a prime number
BaseRepresentation
bin1001011110000100001011…
…0110100011110000101101
31100212101111201002111011122
42113201002312203300231
52331043011303332023
634051132444430325
72123152045322654
oct227410266436055
940771451074148
1010412122324013
113354835676913
121201b328483a5
135a6b2208a047
1427dd4127219b
15130c9abc12c8
hex97842da3c2d

10412122324013 has 2 divisors, whose sum is σ = 10412122324014. Its totient is φ = 10412122324012.

The previous prime is 10412122323991. The next prime is 10412122324031. The reversal of 10412122324013 is 31042322121401.

It is a happy number.

Together with next prime (10412122324031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9455360551849 + 956761772164 = 3074957^2 + 978142^2 .

It is a cyclic number.

It is not a de Polignac number, because 10412122324013 - 236 = 10343402847277 is a prime.

It is a congruent number.

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

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

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

Almost surely, 210412122324013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2304, while the sum is 26.

Adding to 10412122324013 its reverse (31042322121401), we get a palindrome (41454444445414).

The spelling of 10412122324013 in words is "ten trillion, four hundred twelve billion, one hundred twenty-two million, three hundred twenty-four thousand, thirteen".