Search a number
-
+
11890297049 is a prime number
BaseRepresentation
bin10110001001011011…
…11000100011011001
31010200122200200012012
423010231320203121
5143322404001144
65243510155305
7600436600031
oct130455704331
933618620165
1011890297049
115051843184
12237a052b35
131176504737
1480b2228c1
15498d00e9e
hex2c4b788d9

11890297049 has 2 divisors, whose sum is σ = 11890297050. Its totient is φ = 11890297048.

The previous prime is 11890297007. The next prime is 11890297061. The reversal of 11890297049 is 94079209811.

11890297049 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., 8764704400 + 3125592649 = 93620^2 + 55907^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11890297049 - 28 = 11890296793 is a prime.

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

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

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

Almost surely, 211890297049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 326592, while the sum is 50.

The spelling of 11890297049 in words is "eleven billion, eight hundred ninety million, two hundred ninety-seven thousand, forty-nine".