Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0010110001011100111 |
3 | 100120010020220212120200 |
4 | 1131020202112023213 |
5 | 3114300302223421 |
6 | 113535005001543 |
7 | 10140060161304 |
oct | 1351042261347 |
9 | 316106825520 |
10 | 100001211111 |
11 | 3945709301a |
12 | 1746a2532b3 |
13 | 9578b44a89 |
14 | 4ba92980ab |
15 | 29043c8726 |
hex | 17488962e7 |
100001211111 has 12 divisors (see below), whose sum is σ = 152943028992. Its totient is φ = 62745857856.
The previous prime is 100001211091. The next prime is 100001211131. The reversal of 100001211111 is 111112100001.
It is an interprime number because it is at equal distance from previous prime (100001211091) and next prime (100001211131).
It is not a de Polignac number, because 100001211111 - 230 = 98927469287 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 = 100001211093 and 100001211102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001211131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 326801191 + ... + 326801496.
It is an arithmetic number, because the mean of its divisors is an integer number (12745252416).
Almost surely, 2100001211111 is an apocalyptic number.
100001211111 is a deficient number, since it is larger than the sum of its proper divisors (52941817881).
100001211111 is a wasteful number, since it uses less digits than its factorization.
100001211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 653602710 (or 653602707 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100001211111 its reverse (111112100001), we get a palindrome (211113311112).
The spelling of 100001211111 in words is "one hundred billion, one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •