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

bin | 100110101110… |

… | …110101110011 |

3 | 201002211202022 |

4 | 212232311303 |

5 | 10044401311 |

6 | 1001342055 |

7 | 152205356 |

oct | 46566563 |

9 | 21084668 |

10 | 10153331 |

11 | 5805391 |

12 | 349792b |

13 | 21465b6 |

14 | 14c429d |

15 | d585db |

hex | 9aed73 |

10153331 has 2 divisors, whose sum is σ = 10153332. Its totient is φ = 10153330.

The previous prime is 10153321. The next prime is 10153333. The reversal of 10153331 is 13335101.

Adding to 10153331 its reverse (13335101), we get a palindrome (23488432).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^{k}-10153331 is a prime.

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

Together with 10153333, 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 (10153333) by changing a digit.

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

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

It is a self-describing number.

Almost surely, 2^{10153331} is an apocalyptic number.

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

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

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

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

The square root of 10153331 is about 3186.4291926858. The cubic root of 10153331 is about 216.5390272544.

The spelling of 10153331 in words is "ten million, one hundred fifty-three thousand, three hundred thirty-one".

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