Search a number
-
+
1119247261189 is a prime number
BaseRepresentation
bin10000010010011000010…
…101011101111000000101
310221222222021011221110021
4100102120111131320011
5121314204244324224
62214101453055141
7143601663514441
oct20223025357005
93858867157407
101119247261189
113a174099a222
12160b017874b1
1381710539915
143c259807821
151e1aa5cd1e4
hex1049855de05

1119247261189 has 2 divisors, whose sum is σ = 1119247261190. Its totient is φ = 1119247261188.

The previous prime is 1119247261159. The next prime is 1119247261193. The reversal of 1119247261189 is 9811627429111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 650227738689 + 469019522500 = 806367^2 + 684850^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1119247261189 - 27 = 1119247261061 is a prime.

It is a congruent number.

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

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

Almost surely, 21119247261189 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1119247261189 in words is "one trillion, one hundred nineteen billion, two hundred forty-seven million, two hundred sixty-one thousand, one hundred eighty-nine".