Search a number
-
+
1219934891137 is a prime number
BaseRepresentation
bin10001110000001001110…
…010010010110010000001
311022121212100201111122211
4101300021302102302001
5124441411313004022
62332232542302121
7154065060324124
oct21601162226201
94277770644584
101219934891137
1143040a495936
12178521887941
138b068647191
144308bd023bb
1521aeed94e77
hex11c09c92c81

1219934891137 has 2 divisors, whose sum is σ = 1219934891138. Its totient is φ = 1219934891136.

The previous prime is 1219934891093. The next prime is 1219934891173. The reversal of 1219934891137 is 7311984399121.

Together with next prime (1219934891173) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 620945576001 + 598989315136 = 788001^2 + 773944^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1219934891137 is a prime.

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

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

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

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

Almost surely, 21219934891137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2939328, while the sum is 58.

The spelling of 1219934891137 in words is "one trillion, two hundred nineteen billion, nine hundred thirty-four million, eight hundred ninety-one thousand, one hundred thirty-seven".