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

bin | 1001000110001000101010… |

… | …1001111010111010011111 |

3 | 1022102002100120221011101222 |

4 | 2101202022221322322133 |

5 | 2302324032042010421 |

6 | 33134222311123555 |

7 | 2051356232213606 |

oct | 221421251727237 |

9 | 38362316834358 |

10 | 10001010110111 |

11 | 320644a532769 |

12 | 115631a0735bb |

13 | 5771254c5407 |

14 | 2680a134ca3d |

15 | 12523896ecab |

hex | 9188aa7ae9f |

10001010110111 has 8 divisors (see below), whose sum is σ = 10014416731200. Its totient is φ = 9987608816640.

The previous prime is 10001010110101. The next prime is 10001010110153. The reversal of 10001010110111 is 11101101010001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10001010110111 - 2^{10} = 10001010109087 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10001010110101) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2432135 + ... + 5090903.

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

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

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

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

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

The sum of its prime factors is 2663809.

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 10001010110111 its reverse (11101101010001), we get a palindrome (21102111120112).

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

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