Base | Representation |
---|---|
bin | 10110110000101010011011… |
… | …000111000001011110010101 |
3 | 111010102120110110211022022100 |
4 | 112300222123013001132111 |
5 | 101110024033142010401 |
6 | 552521452023152313 |
7 | 30041031552662322 |
oct | 2660523307013625 |
9 | 433376413738270 |
10 | 100101110110101 |
11 | 29993708032441 |
12 | b2883232a5699 |
13 | 43b1656936069 |
14 | 1aa0cc3483b49 |
15 | b88cd61dab86 |
hex | 5b0a9b1c1795 |
100101110110101 has 24 divisors (see below), whose sum is σ = 152203540492640. Its totient is φ = 63220498380000.
The previous prime is 100101110110061. The next prime is 100101110110147. The reversal of 100101110110101 is 101011011101001.
It is not a de Polignac number, because 100101110110101 - 217 = 100101109979029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100101110190101) 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 23 ways as a sum of consecutive naturals, for example, 2862726 + ... + 14435976.
Almost surely, 2100101110110101 is an apocalyptic number.
It is an amenable number.
100101110110101 is a deficient number, since it is larger than the sum of its proper divisors (52102430382539).
100101110110101 is a wasteful number, since it uses less digits than its factorization.
100101110110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11623857 (or 11623854 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100101110110101 its reverse (101011011101001), we get a palindrome (201112121211102).
The spelling of 100101110110101 in words is "one hundred trillion, one hundred one billion, one hundred ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •