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

bin | 1001000110001000101010… |

… | …1101101100100111100011 |

3 | 1022102002100122210110110101 |

4 | 2101202022231230213203 |

5 | 2302324032320201011 |

6 | 33134222344243231 |

7 | 2051356243506142 |

oct | 221421255544743 |

9 | 38362318713411 |

10 | 10001011100131 |

11 | 3206450049567 |

12 | 115631a470517 |

13 | 577125780c1c |

14 | 2680a1529759 |

15 | 125238ab82c1 |

hex | 9188ab6c9e3 |

10001011100131 has 2 divisors, whose sum is σ = 10001011100132. Its totient is φ = 10001011100130.

The previous prime is 10001011100089. The next prime is 10001011100147. The reversal of 10001011100131 is 13100111010001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10001011100131 - 2^{15} = 10001011067363 is a prime.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 10001011100131 its reverse (13100111010001), we get a palindrome (23101122110132).

The spelling of 10001011100131 in words is "ten trillion, one billion, eleven million, one hundred thousand, one hundred thirty-one".

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