Base | Representation |
---|---|
bin | 1001001100011110101011… |
… | …1101101111001100000101 |
3 | 1022210111200021211022111220 |
4 | 2103013222331233030011 |
5 | 2311120240011200401 |
6 | 33300245300550553 |
7 | 2062265140642506 |
oct | 223075275571405 |
9 | 38714607738456 |
10 | 10110000100101 |
11 | 3248699542360 |
12 | 11734766b2459 |
13 | 5844a468bb55 |
14 | 26d48033abad |
15 | 127eb705a336 |
hex | 931eaf6f305 |
10110000100101 has 32 divisors (see below), whose sum is σ = 14793165330048. Its totient is φ = 6090739664640.
The previous prime is 10110000100009. The next prime is 10110000100147. The reversal of 10110000100101 is 10100100001101.
It is not a de Polignac number, because 10110000100101 - 230 = 10108926358277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110000100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110000100171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31565575 + ... + 31884251.
It is an arithmetic number, because the mean of its divisors is an integer number (462286416564).
Almost surely, 210110000100101 is an apocalyptic number.
10110000100101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10110000100101 is a deficient number, since it is larger than the sum of its proper divisors (4683165229947).
10110000100101 is a wasteful number, since it uses less digits than its factorization.
10110000100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324421.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10110000100101 its reverse (10100100001101), we get a palindrome (20210100101202).
The spelling of 10110000100101 in words is "ten trillion, one hundred ten billion, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •