Search a number
-
+
10451111141 is a prime number
BaseRepresentation
bin10011011101110111…
…10100110011100101
3222222100121110021102
421232323310303211
5132400441024031
64445015325445
7516662656532
oct115673646345
928870543242
1010451111141
11448341a539
122038080885
13ca72b5b43
1471202dd89
154127ba7cb
hex26eef4ce5

10451111141 has 2 divisors, whose sum is σ = 10451111142. Its totient is φ = 10451111140.

The previous prime is 10451111137. The next prime is 10451111161. The reversal of 10451111141 is 14111115401.

It is an a-pointer prime, because the next prime (10451111161) can be obtained adding 10451111141 to its sum of digits (20).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6738768100 + 3712343041 = 82090^2 + 60929^2 .

It is a cyclic number.

It is not a de Polignac number, because 10451111141 - 22 = 10451111137 is a prime.

It is a congruent number.

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

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

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

Almost surely, 210451111141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 80, while the sum is 20.

Adding to 10451111141 its reverse (14111115401), we get a palindrome (24562226542).

The spelling of 10451111141 in words is "ten billion, four hundred fifty-one million, one hundred eleven thousand, one hundred forty-one".