Search a number
-
+
1056113 is a prime number
BaseRepresentation
bin100000001110101110001
31222122201022
410001311301
5232243423
634345225
711656022
oct4016561
91878638
101056113
11661523
1242b215
132ac926
141d6c49
1515cdc8
hex101d71

1056113 has 2 divisors, whose sum is σ = 1056114. Its totient is φ = 1056112.

The previous prime is 1056109. The next prime is 1056149. The reversal of 1056113 is 3116501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 868624 + 187489 = 932^2 + 433^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1056113 - 22 = 1056109 is a prime.

It is a super-2 number, since 2×10561132 = 2230749337538, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1056091 and 1056100.

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

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

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

21056113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90, while the sum is 17.

The square root of 1056113 is about 1027.6735863104. The cubic root of 1056113 is about 101.8364995597.

The spelling of 1056113 in words is "one million, fifty-six thousand, one hundred thirteen".