Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …000110011001100000111000 |
3 | 111010001220202200101022012121 |
4 | 112233030113012121200320 |
5 | 101101400211420343404 |
6 | 552403230012051024 |
7 | 30030524655421606 |
oct | 2657142706314070 |
9 | 433056680338177 |
10 | 100000111106104 |
11 | 299548997a3900 |
12 | b270836a63a74 |
13 | 43a4c7c1778c1 |
14 | 1a9a061894876 |
15 | b86374419e54 |
hex | 5af317199838 |
100000111106104 has 48 divisors (see below), whose sum is σ = 206138100452760. Its totient is φ = 45445149710400.
The previous prime is 100000111106101. The next prime is 100000111106107. The reversal of 100000111106104 is 401601111000001.
It is an interprime number because it is at equal distance from previous prime (100000111106101) and next prime (100000111106107).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000111106101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6072982 + ... + 15390949.
Almost surely, 2100000111106104 is an apocalyptic number.
It is an amenable number.
100000111106104 is an abundant number, since it is smaller than the sum of its proper divisors (106137989346656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000111106104 is a wasteful number, since it uses less digits than its factorization.
100000111106104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21468772 (or 21468757 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 100000111106104 its reverse (401601111000001), we get a palindrome (501601222106105).
The spelling of 100000111106104 in words is "one hundred trillion, one hundred eleven million, one hundred six thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •