Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …000100110000000111100111 |
3 | 111010001220111122011010221121 |
4 | 112233030101010300013213 |
5 | 101101400010030323421 |
6 | 552403212001154411 |
7 | 30030522320216200 |
oct | 2657142104600747 |
9 | 433056448133847 |
10 | 100000010011111 |
11 | 29954847724721 |
12 | b27080902ba07 |
13 | 43a4c6423c892 |
14 | 1a9a05229a5a7 |
15 | b8636a5ead41 |
hex | 5af3111301e7 |
100000010011111 has 24 divisors (see below), whose sum is σ = 116389326138624. Its totient is φ = 85668038023680.
The previous prime is 100000010011051. The next prime is 100000010011147. The reversal of 100000010011111 is 111110010000001.
It is a happy number.
It is not a de Polignac number, because 100000010011111 - 29 = 100000010010599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 100000010011094 and 100000010011103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000010014111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2564543631 + ... + 2564582623.
It is an arithmetic number, because the mean of its divisors is an integer number (4849555255776).
Almost surely, 2100000010011111 is an apocalyptic number.
100000010011111 is a deficient number, since it is larger than the sum of its proper divisors (16389316127513).
100000010011111 is a wasteful number, since it uses less digits than its factorization.
100000010011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65911 (or 65904 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100000010011111 its reverse (111110010000001), we get a palindrome (211110020011112).
The spelling of 100000010011111 in words is "one hundred trillion, ten million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •