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

bin | 11110100001100100111 |

3 | 1212211001121 |

4 | 3310030213 |

5 | 224001411 |

6 | 33234411 |

7 | 11334061 |

oct | 3641447 |

9 | 1784047 |

10 | 1000231 |

11 | 623541 |

12 | 402a07 |

13 | 29036b |

14 | 1c0731 |

15 | 14b571 |

hex | f4327 |

1000231 has 2 divisors, whose sum is σ = 1000232. Its totient is φ = 1000230.

The previous prime is 1000213. The next prime is 1000249. The reversal of 1000231 is 1320001.

Adding to 1000231 its reverse (1320001), we get a palindrome (2320232).

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

It is a balanced prime because it is at equal distance from previous prime (1000213) and next prime (1000249).

It is a cyclic number.

It is not a de Polignac number, because 1000231 - 2^{5} = 1000199 is a prime.

It is a super-2 number, since 2×1000231^{2} = 2000924106722, which contains 22 as substring.

1000231 is a modest number, since divided by 231 gives 1 as remainder.

It is a congruent number.

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

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

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

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

2^{1000231} is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 7.

The square root of 1000231 is about 1000.1154933306. The cubic root of 1000231 is about 100.0076994072.

The spelling of 1000231 in words is "one million, two hundred thirty-one", and thus it is an aban number.

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