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

bin | 10010110100000001… |

… | …10100111111111101 |

3 | 222001220010022001011 |

4 | 21122000310333331 |

5 | 131141111213432 |

6 | 4350120115221 |

7 | 505201304641 |

oct | 113200647775 |

9 | 28056108034 |

10 | 10100101117 |

11 | 4313275507 |

12 | 1b5a605b11 |

13 | c4c667cc2 |

14 | 6bb57cc21 |

15 | 3e1a82847 |

hex | 25a034ffd |

10100101117 has 2 divisors, whose sum is σ = 10100101118. Its totient is φ = 10100101116.

The previous prime is 10100101069. The next prime is 10100101163. The reversal of 10100101117 is 71110100101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10094019961 + 6081156 = 100469^2 + 2466^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 10100101097 and 10100101106.

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 10100101117 its reverse (71110100101), we get a palindrome (81210201218).

The spelling of 10100101117 in words is "ten billion, one hundred million, one hundred one thousand, one hundred seventeen".

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