Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …000110011001100000110111 |
3 | 111010001220202200101022012120 |
4 | 112233030113012121200313 |
5 | 101101400211420343403 |
6 | 552403230012051023 |
7 | 30030524655421605 |
oct | 2657142706314067 |
9 | 433056680338176 |
10 | 100000111106103 |
11 | 299548997a38aa |
12 | b270836a63a73 |
13 | 43a4c7c1778c0 |
14 | 1a9a061894875 |
15 | b86374419e53 |
hex | 5af317199837 |
100000111106103 has 32 divisors (see below), whose sum is σ = 143846110087680. Its totient is φ = 61428734052480.
The previous prime is 100000111106101. The next prime is 100000111106107. The reversal of 100000111106103 is 301601111000001.
It is not a de Polignac number, because 100000111106103 - 21 = 100000111106101 is a prime.
It is a super-2 number, since 2×1000001111061032 (a number of 29 digits) contains 22 as substring.
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 polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 951034150 + ... + 951139292.
It is an arithmetic number, because the mean of its divisors is an integer number (4495190940240).
Almost surely, 2100000111106103 is an apocalyptic number.
100000111106103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
100000111106103 is a deficient number, since it is larger than the sum of its proper divisors (43845998981577).
100000111106103 is a wasteful number, since it uses less digits than its factorization.
100000111106103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148439.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 100000111106103 its reverse (301601111000001), we get a palindrome (401601222106104).
The spelling of 100000111106103 in words is "one hundred trillion, one hundred eleven million, one hundred six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •