Base | Representation |
---|---|
bin | 10110110000110010101100… |
… | …111111101011111000000111 |
3 | 111010110102102000221011002000 |
4 | 112300302230333223320013 |
5 | 101110200240012023421 |
6 | 552525522114520343 |
7 | 30041465061514524 |
oct | 2660625477537007 |
9 | 433412360834060 |
10 | 100110000111111 |
11 | 2999745a222811 |
12 | b289ba45960b3 |
13 | 43b24426815a3 |
14 | 1aa14c802414b |
15 | b891568da226 |
hex | 5b0cacfebe07 |
100110000111111 has 128 divisors (see below), whose sum is σ = 157133813760000. Its totient is φ = 62817466239360.
The previous prime is 100110000111101. The next prime is 100110000111137. The reversal of 100110000111111 is 111111000011001.
It is not a de Polignac number, because 100110000111111 - 221 = 100109998013959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100110000111093 and 100110000111102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110000111101) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 75898407310 + ... + 75898408628.
It is an arithmetic number, because the mean of its divisors is an integer number (1227607920000).
Almost surely, 2100110000111111 is an apocalyptic number.
100110000111111 is a deficient number, since it is larger than the sum of its proper divisors (57023813648889).
100110000111111 is a wasteful number, since it uses less digits than its factorization.
100110000111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2954 (or 2948 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100110000111111 its reverse (111111000011001), we get a palindrome (211221000122112).
The spelling of 100110000111111 in words is "one hundred trillion, one hundred ten billion, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •