Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …000011100010001100001011 |
3 | 111010110102102002211102000200 |
4 | 112300302231003202030023 |
5 | 101110200240241320021 |
6 | 552525522152303243 |
7 | 30041465103216111 |
oct | 2660625503421413 |
9 | 433412362742020 |
10 | 100110001120011 |
11 | 2999745a851813 |
12 | b289ba49a1b23 |
13 | 43b244294587c |
14 | 1aa14c8207ab1 |
15 | b89156a39126 |
hex | 5b0cad0e230b |
100110001120011 has 48 divisors (see below), whose sum is σ = 153265865351040. Its totient is φ = 62791845062400.
The previous prime is 100110001119991. The next prime is 100110001120037. The reversal of 100110001120011 is 110021100011001.
It is not a de Polignac number, because 100110001120011 - 25 = 100110001119979 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 = 100110001119975 and 100110001120002.
It is not an unprimeable number, because it can be changed into a prime (100110001120711) 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, 12349876 + ... + 18781358.
It is an arithmetic number, because the mean of its divisors is an integer number (3193038861480).
Almost surely, 2100110001120011 is an apocalyptic number.
100110001120011 is a deficient number, since it is larger than the sum of its proper divisors (53155864231029).
100110001120011 is a wasteful number, since it uses less digits than its factorization.
100110001120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6432136 (or 6432133 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100110001120011 its reverse (110021100011001), we get a palindrome (210131101131012).
The spelling of 100110001120011 in words is "one hundred trillion, one hundred ten billion, one million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •