Search a number
-
+
10645301411111 is a prime number
BaseRepresentation
bin1001101011101000110101…
…1010001011110100100111
31101200200101100200102200202
42122322031122023310213
52343403034130123421
634350214533501115
72146045331005223
oct232721532136447
941620340612622
1010645301411111
113434713140254
12123b169aa179b
135c2b0329a023
1428b341aa1783
15136d96ddb10b
hex9ae8d68bd27

10645301411111 has 2 divisors, whose sum is σ = 10645301411112. Its totient is φ = 10645301411110.

The previous prime is 10645301411099. The next prime is 10645301411117. The reversal of 10645301411111 is 11111410354601.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10645301411111 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210645301411111 is an apocalyptic number.

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

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

10645301411111 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1440, while the sum is 29.

Adding to 10645301411111 its reverse (11111410354601), we get a palindrome (21756711765712).

The spelling of 10645301411111 in words is "ten trillion, six hundred forty-five billion, three hundred one million, four hundred eleven thousand, one hundred eleven".