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

bin | 111101100001001011… |

… | …1110001010110010111 |

3 | 110121222222022212221122 |

4 | 1323002113301112113 |

5 | 4131030131431411 |

6 | 140405052234155 |

7 | 12354544504664 |

oct | 1730227612627 |

9 | 417888285848 |

10 | 132110030231 |

11 | 51033739073 |

12 | 2172b46b95b |

13 | c5c5094c2a |

14 | 6573806a6b |

15 | 368320c9db |

hex | 1ec25f1597 |

132110030231 has 2 divisors, whose sum is σ = 132110030232. Its totient is φ = 132110030230.

The previous prime is 132110030161. The next prime is 132110030279. The reversal of 132110030231 is 132030011231.

Adding to 132110030231 its reverse (132030011231), we get a palindrome (264140041462).

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×132110030231^{2} (a number of 23 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

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

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

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

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

The spelling of 132110030231 in words is "one hundred thirty-two billion, one hundred ten million, thirty thousand, two hundred thirty-one".

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