Search a number
-
+
11010550045969 is a prime number
BaseRepresentation
bin1010000000111001011111…
…1011001001110100010001
31102222121011011102112122201
42200032113323021310101
52420344101302432334
635230102111403201
72214325460120665
oct240162773116421
942877134375581
1011010550045969
113565603502671
121299b02b23501
1361b3a10698c6
142a0cb079a8a5
151416229b8c14
hexa0397ec9d11

11010550045969 has 2 divisors, whose sum is σ = 11010550045970. Its totient is φ = 11010550045968.

The previous prime is 11010550045949. The next prime is 11010550045987. The reversal of 11010550045969 is 96954005501011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8929859194369 + 2080690851600 = 2988287^2 + 1442460^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010550045969 - 27 = 11010550045841 is a prime.

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

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

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

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

Almost surely, 211010550045969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 243000, while the sum is 46.

The spelling of 11010550045969 in words is "eleven trillion, ten billion, five hundred fifty million, forty-five thousand, nine hundred sixty-nine".