Search a number
-
+
11199756481 is a prime number
BaseRepresentation
bin10100110111000111…
…01011100011000001
31001220112022120121121
422123203223203001
5140414114201411
65051201352241
7544353234154
oct123343534301
931815276547
1011199756481
114827a748a1
122206938681
131096427b54
1478362bc9b
1545839b571
hex29b8eb8c1

11199756481 has 2 divisors, whose sum is σ = 11199756482. Its totient is φ = 11199756480.

The previous prime is 11199756467. The next prime is 11199756497. The reversal of 11199756481 is 18465799111.

It is a happy number.

11199756481 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., 6532680625 + 4667075856 = 80825^2 + 68316^2 .

It is a cyclic number.

It is not a de Polignac number, because 11199756481 - 213 = 11199748289 is a prime.

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

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

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

Almost surely, 211199756481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 544320, while the sum is 52.

The spelling of 11199756481 in words is "eleven billion, one hundred ninety-nine million, seven hundred fifty-six thousand, four hundred eighty-one".