Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …101101100100001001100001 |
3 | 111010111101111202021110020022 |
4 | 112300330013231210021201 |
5 | 101110331442134201423 |
6 | 552534313340123225 |
7 | 30042303465400601 |
oct | 2660740755441141 |
9 | 433441452243208 |
10 | 100120112022113 |
11 | 299a0779124157 |
12 | b28bb46b36515 |
13 | 43b33945c2b91 |
14 | 1aa1ba6d98c01 |
15 | b89549501dc8 |
hex | 5b0f07b64261 |
100120112022113 has 16 divisors (see below), whose sum is σ = 100333317427200. Its totient is φ = 99907165132800.
The previous prime is 100120112022067. The next prime is 100120112022187. The reversal of 100120112022113 is 311220211021001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 100120112022113 - 214 = 100120112005729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100120112022091 and 100120112022100.
It is not an unprimeable number, because it can be changed into a prime (100120112022313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5770270388 + ... + 5770287738.
It is an arithmetic number, because the mean of its divisors is an integer number (6270832339200).
Almost surely, 2100120112022113 is an apocalyptic number.
It is an amenable number.
100120112022113 is a deficient number, since it is larger than the sum of its proper divisors (213205405087).
100120112022113 is a wasteful number, since it uses less digits than its factorization.
100120112022113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24112.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 100120112022113 its reverse (311220211021001), we get a palindrome (411340323043114).
The spelling of 100120112022113 in words is "one hundred trillion, one hundred twenty billion, one hundred twelve million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.786 sec. • engine limits •