Search a number
-
+
10995991913 is a prime number
BaseRepresentation
bin10100011110110100…
…11000010101101001
31001101022220021011202
422033122120111221
5140004433220123
65015042133545
7536330250314
oct121732302551
931338807152
1010995991913
114732a50525
12216a6512b5
1310631531ba
1476454997b
1544554ba28
hex28f698569

10995991913 has 2 divisors, whose sum is σ = 10995991914. Its totient is φ = 10995991912.

The previous prime is 10995991849. The next prime is 10995991933. The reversal of 10995991913 is 31919959901.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9949663504 + 1046328409 = 99748^2 + 32347^2 .

It is a cyclic number.

It is not a de Polignac number, because 10995991913 - 26 = 10995991849 is a prime.

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

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

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

Almost surely, 210995991913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 885735, while the sum is 56.

The spelling of 10995991913 in words is "ten billion, nine hundred ninety-five million, nine hundred ninety-one thousand, nine hundred thirteen".