Base | Representation |
---|---|
bin | 10110110000111101111110… |
… | …110011101011000101101111 |
3 | 111010111120200000000221102120 |
4 | 112300331332303223011233 |
5 | 101110400040142041421 |
6 | 552535243514124023 |
7 | 30042404140026063 |
oct | 2660757663530557 |
9 | 433446600027376 |
10 | 100122110112111 |
11 | 299a1603a867aa |
12 | b290404120613 |
13 | 43b362254ba59 |
14 | 1aa1d164b7aa3 |
15 | b89614b388c6 |
hex | 5b0f7eceb16f |
100122110112111 has 8 divisors (see below), whose sum is σ = 137104150784304. Its totient is φ = 64944071424000.
The previous prime is 100122110112053. The next prime is 100122110112163. The reversal of 100122110112111 is 111211011221001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100122110112111 - 210 = 100122110111087 is a prime.
It is a super-3 number, since 3×1001221101121113 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100122610112111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451000495890 + ... + 451000496111.
It is an arithmetic number, because the mean of its divisors is an integer number (17138018848038).
Almost surely, 2100122110112111 is an apocalyptic number.
100122110112111 is a deficient number, since it is larger than the sum of its proper divisors (36982040672193).
100122110112111 is an equidigital number, since it uses as much as digits as its factorization.
100122110112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 902000992041.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 100122110112111 its reverse (111211011221001), we get a palindrome (211333121333112).
The spelling of 100122110112111 in words is "one hundred trillion, one hundred twenty-two billion, one hundred ten million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •