Search a number
-
+
1094057 is a prime number
BaseRepresentation
bin100001011000110101001
32001120202122
410023012221
5240002212
635241025
712204446
oct4130651
92046678
101094057
11687a88
12449175
132c3c93
142069cd
15169272
hex10b1a9

1094057 has 2 divisors, whose sum is σ = 1094058. Its totient is φ = 1094056.

The previous prime is 1094047. The next prime is 1094059. The reversal of 1094057 is 7504901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1038361 + 55696 = 1019^2 + 236^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1094057 - 26 = 1093993 is a prime.

Together with 1094059, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

21094057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 26.

The square root of 1094057 is about 1045.9717969429. The cubic root of 1094057 is about 103.0417714760.

Adding to 1094057 its reverse (7504901), we get a palindrome (8598958).

The spelling of 1094057 in words is "one million, ninety-four thousand, fifty-seven".