Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001001011111111001000111 |
3 | 111010002000001201002020120000 |
4 | 112233031030021133321013 |
5 | 101101404022241023421 |
6 | 552403454204012343 |
7 | 30030556013351442 |
oct | 2657151411377107 |
9 | 433060051066500 |
10 | 100001001111111 |
11 | 29955206119831 |
12 | b270a44b310b3 |
13 | 43a5091681a99 |
14 | 1a9a107b6c659 |
15 | b863c7620226 |
hex | 5af34c25fe47 |
100001001111111 has 40 divisors (see below), whose sum is σ = 149482694606784. Its totient is φ = 66623397168960.
The previous prime is 100001001111079. The next prime is 100001001111119. The reversal of 100001001111111 is 111111100100001.
It is not a de Polignac number, because 100001001111111 - 25 = 100001001111079 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 = 100001001111093 and 100001001111102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001001111119) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 798533481 + ... + 798658701.
Almost surely, 2100001001111111 is an apocalyptic number.
100001001111111 is a deficient number, since it is larger than the sum of its proper divisors (49481693495673).
100001001111111 is a wasteful number, since it uses less digits than its factorization.
100001001111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131653 (or 131644 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100001001111111 its reverse (111111100100001), we get a palindrome (211112101211112).
The spelling of 100001001111111 in words is "one hundred trillion, one billion, one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •