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

bin | 10100011111101010… |

… | …01110111001011011 |

3 | 1001101211010220011112 |

4 | 22033311032321123 |

5 | 140013233444011 |

6 | 5015453050535 |

7 | 536444135651 |

oct | 121765167133 |

9 | 31354126145 |

10 | 11003031131 |

11 | 4736a19164 |

12 | 2170a86a4b |

13 | 1064749211 |

14 | 76545cdd1 |

15 | 445e8c58b |

hex | 28fd4ee5b |

11003031131 has 2 divisors, whose sum is σ = 11003031132. Its totient is φ = 11003031130.

The previous prime is 11003031121. The next prime is 11003031191. The reversal of 11003031131 is 13113030011.

It is a happy number.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 11003031131 - 2^{14} = 11003014747 is a prime.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 27, while the sum is 14.

Adding to 11003031131 its reverse (13113030011), we get a palindrome (24116061142).

The spelling of 11003031131 in words is "eleven billion, three million, thirty-one thousand, one hundred thirty-one".

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