Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000000111011011001000101 |
3 | 111010110102200001221220220222 |
4 | 112300302303000323121011 |
5 | 101110200441340200401 |
6 | 552525540123234125 |
7 | 30041500426066211 |
oct | 2660626300733105 |
9 | 433412601856828 |
10 | 100110101100101 |
11 | 2999750122a294 |
12 | b28a012378945 |
13 | 43b245a5802a1 |
14 | 1aa14d75d1941 |
15 | b891606d7c1b |
hex | 5b0cb303b645 |
100110101100101 has 16 divisors (see below), whose sum is σ = 105523699344000. Its totient is φ = 94711040424000.
The previous prime is 100110101100017. The next prime is 100110101100283. The reversal of 100110101100101 is 101001101011001.
It is a cyclic number.
It is not a de Polignac number, because 100110101100101 - 210 = 100110101099077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110101100601) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48435776 + ... + 50460326.
It is an arithmetic number, because the mean of its divisors is an integer number (6595231209000).
Almost surely, 2100110101100101 is an apocalyptic number.
It is an amenable number.
100110101100101 is a deficient number, since it is larger than the sum of its proper divisors (5413598243899).
100110101100101 is a wasteful number, since it uses less digits than its factorization.
100110101100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2028140.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 100110101100101 its reverse (101001101011001), we get a palindrome (201111202111102).
It can be divided in two parts, 10011010 and 1100101, that added together give a palindrome (11111111).
The spelling of 100110101100101 in words is "one hundred trillion, one hundred ten billion, one hundred one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •