Search a number
-
+
1092064092337 is a prime number
BaseRepresentation
bin11111110010001000001…
…01111010000010110001
310212101210211020212222201
433321010011322002301
5120343021401423322
62153404243303201
7141620236424341
oct17710405720261
93771724225881
101092064092337
1139116178a119
1215779607ab01
137bc9a915a1a
143abdb524d21
151d618e15d27
hexfe4417a0b1

1092064092337 has 2 divisors, whose sum is σ = 1092064092338. Its totient is φ = 1092064092336.

The previous prime is 1092064092313. The next prime is 1092064092373. The reversal of 1092064092337 is 7332904602901.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1006097265936 + 85966826401 = 1003044^2 + 293201^2 .

It is a cyclic number.

It is not a de Polignac number, because 1092064092337 - 27 = 1092064092209 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21092064092337 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1092064092337 in words is "one trillion, ninety-two billion, sixty-four million, ninety-two thousand, three hundred thirty-seven".