Base | Representation |
---|---|
bin | 100000100000010101101 |
3 | 2000010002101 |
4 | 10010002231 |
5 | 233041013 |
6 | 34455101 |
7 | 12024226 |
oct | 4040255 |
9 | 2003071 |
10 | 1065133 |
11 | 668283 |
12 | 434491 |
13 | 2b3a74 |
14 | 1da24d |
15 | 1608dd |
hex | 1040ad |
1065133 has 2 divisors, whose sum is σ = 1065134. Its totient is φ = 1065132.
The previous prime is 1065131. The next prime is 1065137. The reversal of 1065133 is 3315601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1054729 + 10404 = 1027^2 + 102^2 .
It is a cyclic number.
It is not a de Polignac number, because 1065133 - 21 = 1065131 is a prime.
It is a super-2 number, since 2×10651332 = 2269016615378, which contains 22 as substring.
Together with 1065131, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1065133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1065131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532566 + 532567.
It is an arithmetic number, because the mean of its divisors is an integer number (532567).
21065133 is an apocalyptic number.
It is an amenable number.
1065133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1065133 is an equidigital number, since it uses as much as digits as its factorization.
1065133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1065133 is about 1032.0528087264. The cubic root of 1065133 is about 102.1255981961.
The spelling of 1065133 in words is "one million, sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •