Base | Representation |
---|---|

bin | 100000100000010110001 |

3 | 2000010002112 |

4 | 10010002301 |

5 | 233041022 |

6 | 34455105 |

7 | 12024233 |

oct | 4040261 |

9 | 2003075 |

10 | 1065137 |

11 | 668287 |

12 | 434495 |

13 | 2b3a78 |

14 | 1da253 |

15 | 1608e2 |

hex | 1040b1 |

1065137 has 2 divisors, whose sum is σ = 1065138. Its totient is φ = 1065136.

The previous prime is 1065133. The next prime is 1065173. The reversal of 1065137 is 7315601.

Together with next prime (1065173) 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., 1008016 + 57121 = 1004^2 + 239^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1065137 - 2^{2} = 1065133 is a prime.

It is a super-3 number, since 3×1065137^{3} = 3625247554333579059, which contains 333 as substring. Note that it is a super-*d* number also for *d* = 2.

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

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

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

2^{1065137} is an apocalyptic number.

It is an amenable number.

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

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

1065137 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 630, while the sum is 23.

The square root of 1065137 is about 1032.0547466099. The cubic root of 1065137 is about 102.1257260368.

The spelling of 1065137 in words is "one million, sixty-five thousand, one hundred thirty-seven".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •