Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …100110000000000101100111 |
3 | 111010110111222201102100000100 |
4 | 112300303220212000011213 |
5 | 101110204312000323421 |
6 | 552530205234115143 |
7 | 30041531622521055 |
oct | 2660635046000547 |
9 | 433414881370010 |
10 | 100111000011111 |
11 | 29997922688451 |
12 | b28a22341bab3 |
13 | 43b25718850ab |
14 | 1aa1580b471d5 |
15 | b891b459bc26 |
hex | 5b0ce8980167 |
100111000011111 has 48 divisors (see below), whose sum is σ = 155218012185600. Its totient is φ = 62051294398464.
The previous prime is 100111000011103. The next prime is 100111000011163. The reversal of 100111000011111 is 111110000111001.
It is not a de Polignac number, because 100111000011111 - 23 = 100111000011103 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 = 100111000011093 and 100111000011102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111000019111) 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, 52499751 + ... + 54373208.
It is an arithmetic number, because the mean of its divisors is an integer number (3233708587200).
Almost surely, 2100111000011111 is an apocalyptic number.
100111000011111 is a deficient number, since it is larger than the sum of its proper divisors (55107012174489).
100111000011111 is a wasteful number, since it uses less digits than its factorization.
100111000011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106873128 (or 106873125 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 100111000011111 its reverse (111110000111001), we get a palindrome (211221000122112).
The spelling of 100111000011111 in words is "one hundred trillion, one hundred eleven billion, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •