Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …100111000100110011000101 |
3 | 111010110102200202202222100100 |
4 | 112300302303213010303011 |
5 | 101110201001420200401 |
6 | 552525541121434313 |
7 | 30041500610065554 |
oct | 2660626347046305 |
9 | 433412622688310 |
10 | 100110111100101 |
11 | 2999750693a453 |
12 | b28a01579b999 |
13 | 43b245c671b4b |
14 | 1aa14d8a75d9b |
15 | b89161510b86 |
hex | 5b0cb39c4cc5 |
100110111100101 has 48 divisors (see below), whose sum is σ = 148315193842816. Its totient is φ = 65034468753408.
The previous prime is 100110111100079. The next prime is 100110111100169. The reversal of 100110111100101 is 101001111011001.
It is not a de Polignac number, because 100110111100101 - 29 = 100110111099589 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 Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110111100301) 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 47 ways as a sum of consecutive naturals, for example, 300133320 + ... + 300466686.
Almost surely, 2100110111100101 is an apocalyptic number.
It is an amenable number.
100110111100101 is a deficient number, since it is larger than the sum of its proper divisors (48205082742715).
100110111100101 is a wasteful number, since it uses less digits than its factorization.
100110111100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335242 (or 335239 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100110111100101 its reverse (101001111011001), we get a palindrome (201111222111102).
The spelling of 100110111100101 in words is "one hundred trillion, one hundred ten billion, one hundred eleven million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •