Search a number
-
+
10369533689861 is a prime number
BaseRepresentation
bin1001011011100101100001…
…0111110100000000000101
31100201022120122001201012012
42112321120113310000011
52324343301111033421
634015410434304005
72120113466026553
oct226713027640005
940638518051165
1010369533689861
113338770486705
1211b5827a28005
135a2ac5913cc8
1427bc60d80bd3
1512eb06d0195b
hex96e585f4005

10369533689861 has 2 divisors, whose sum is σ = 10369533689862. Its totient is φ = 10369533689860.

The previous prime is 10369533689833. The next prime is 10369533689899. The reversal of 10369533689861 is 16898633596301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7189267800961 + 3180265888900 = 2681281^2 + 1783330^2 .

It is a cyclic number.

It is not a de Polignac number, because 10369533689861 - 26 = 10369533689797 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210369533689861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151165440, while the sum is 68.

The spelling of 10369533689861 in words is "ten trillion, three hundred sixty-nine billion, five hundred thirty-three million, six hundred eighty-nine thousand, eight hundred sixty-one".