Search a number
-
+
10540781 is a prime number
BaseRepresentation
bin101000001101…
…011011101101
3201211112020022
4220031123231
510144301111
61013531525
7155411066
oct50153355
921745208
1010540781
115a4a499
123643ba5
132250a64
14158556d
15dd32db
hexa0d6ed

10540781 has 2 divisors, whose sum is σ = 10540782. Its totient is φ = 10540780.

The previous prime is 10540771. The next prime is 10540807. The reversal of 10540781 is 18704501.

It is an a-pointer prime, because the next prime (10540807) can be obtained adding 10540781 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9954025 + 586756 = 3155^2 + 766^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×105407812 = 222216128179922, which contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 210540781 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10540781 is about 3246.6568959470. The cubic root of 10540781 is about 219.2590846839.

The spelling of 10540781 in words is "ten million, five hundred forty thousand, seven hundred eighty-one".