Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …100010110111001010100111 |
3 | 111010002212112220011001121100 |
4 | 112233111222202313022213 |
5 | 101102031141324323421 |
6 | 552412001154251143 |
7 | 30031330351260234 |
oct | 2657255242671247 |
9 | 433085486131540 |
10 | 100010101011111 |
11 | 29959055843345 |
12 | b272764586ab3 |
13 | 43a5bb1a3c1b5 |
14 | 1a9a72c54a78b |
15 | b8675b481c26 |
hex | 5af56a8b72a7 |
100010101011111 has 48 divisors (see below), whose sum is σ = 154318327308288. Its totient is φ = 62299562270400.
The previous prime is 100010101011091. The next prime is 100010101011133. The reversal of 100010101011111 is 111110101010001.
It is not a de Polignac number, because 100010101011111 - 210 = 100010101010087 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 = 100010101011093 and 100010101011102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010101011181) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35625111 + ... + 38329736.
It is an arithmetic number, because the mean of its divisors is an integer number (3214965152256).
Almost surely, 2100010101011111 is an apocalyptic number.
100010101011111 is a deficient number, since it is larger than the sum of its proper divisors (54308226297177).
100010101011111 is a wasteful number, since it uses less digits than its factorization.
100010101011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73955052 (or 73955049 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100010101011111 its reverse (111110101010001), we get a palindrome (211120202021112).
The spelling of 100010101011111 in words is "one hundred trillion, ten billion, one hundred one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •