Search a number
-
+
10947963925387 is a prime number
BaseRepresentation
bin1001111101010000010110…
…0000000011001110001011
31102202121121102121012101201
42133110011200003032023
52413332412231103022
635141231501525031
72206651515640066
oct237240540031613
942677542535351
1010947963925387
11354100724a975
121289956b73777
136155088b9068
1429bc546798dd
1513ebad1c8127
hex9f50580338b

10947963925387 has 2 divisors, whose sum is σ = 10947963925388. Its totient is φ = 10947963925386.

The previous prime is 10947963925357. The next prime is 10947963925403. The reversal of 10947963925387 is 78352936974901.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10947963925387 - 219 = 10947963401099 is a prime.

It is a super-2 number, since 2×109479639253872 (a number of 27 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (10947963925307) 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, 5473981962693 + 5473981962694.

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

It is a 1-persistent number, because it is pandigital, but 2⋅10947963925387 = 21895927850774 is not.

Almost surely, 210947963925387 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 617258880, while the sum is 73.

The spelling of 10947963925387 in words is "ten trillion, nine hundred forty-seven billion, nine hundred sixty-three million, nine hundred twenty-five thousand, three hundred eighty-seven".