Search a number
-
+
10841282756753 is a prime number
BaseRepresentation
bin1001110111000010111011…
…0011101100000010010001
31102101102020122011022202212
42131300232303230002101
52410110421341204003
635020225550121505
72166154043652611
oct235605663540221
942342218138685
1010841282756753
1134aa8425369a9
1212711437b0295
13608436b659c7
14296a14174a41
1513c017652dd8
hex9dc2ecec091

10841282756753 has 2 divisors, whose sum is σ = 10841282756754. Its totient is φ = 10841282756752.

The previous prime is 10841282756747. The next prime is 10841282756929. The reversal of 10841282756753 is 35765728214801.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10769213595904 + 72069160849 = 3281648^2 + 268457^2 .

It is a cyclic number.

It is not a de Polignac number, because 10841282756753 - 220 = 10841281708177 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10841282756692 and 10841282756701.

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

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

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

Almost surely, 210841282756753 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22579200, while the sum is 59.

The spelling of 10841282756753 in words is "ten trillion, eight hundred forty-one billion, two hundred eighty-two million, seven hundred fifty-six thousand, seven hundred fifty-three".