Search a number
-
+
10863095941 is a prime number
BaseRepresentation
bin10100001110111110…
…11011000010000101
31001001001211110011201
422013133123002011
5134221423032231
64553533502501
7533124535435
oct120737330205
931031743151
1010863095941
114674a30845
122132041a31
131041762529
14750a342c5
15438a4a161
hex2877db085

10863095941 has 2 divisors, whose sum is σ = 10863095942. Its totient is φ = 10863095940.

The previous prime is 10863095939. The next prime is 10863095963. The reversal of 10863095941 is 14959036801.

10863095941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9011515041 + 1851580900 = 94929^2 + 43030^2 .

It is a cyclic number.

It is not a de Polignac number, because 10863095941 - 21 = 10863095939 is a prime.

Together with 10863095939, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

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

Almost surely, 210863095941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 233280, while the sum is 46.

The spelling of 10863095941 in words is "ten billion, eight hundred sixty-three million, ninety-five thousand, nine hundred forty-one".