Search a number
-
+
10791248944871 is a prime number
BaseRepresentation
bin1001110100001000100010…
…0011110101111011100111
31102012122002200201022222002
42131002020203311323213
52403300434212213441
634541233055555515
72162433131404133
oct235021043657347
942178080638862
1010791248944871
1134905a777a54a
1212634bb52bb9b
136037c20b7c65
142944291623c3
1513aa89d2eb9b
hex9d0888f5ee7

10791248944871 has 2 divisors, whose sum is σ = 10791248944872. Its totient is φ = 10791248944870.

The previous prime is 10791248944799. The next prime is 10791248944901. The reversal of 10791248944871 is 17844984219701.

It is a strong prime.

It is an emirp because it is prime and its reverse (17844984219701) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10791248944871 - 222 = 10791244750567 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210791248944871 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 32514048, while the sum is 65.

The spelling of 10791248944871 in words is "ten trillion, seven hundred ninety-one billion, two hundred forty-eight million, nine hundred forty-four thousand, eight hundred seventy-one".