Base | Representation |
---|---|
bin | 10110110001001000000111… |
… | …111101011111101101010001 |
3 | 111010112121210000100110022120 |
4 | 112301020013331133231101 |
5 | 101111034341240200423 |
6 | 552544244325524453 |
7 | 30043241053633512 |
oct | 2661100775375521 |
9 | 433477700313276 |
10 | 100133001100113 |
11 | 299a6192728233 |
12 | b292543573729 |
13 | 43b46699c8957 |
14 | 1aa266aacca09 |
15 | b89a50d42ee3 |
hex | 5b1207f5fb51 |
100133001100113 has 64 divisors (see below), whose sum is σ = 135674020306944. Its totient is φ = 65685470400000.
The previous prime is 100133001100087. The next prime is 100133001100133. The reversal of 100133001100113 is 311001100331001.
It is not a de Polignac number, because 100133001100113 - 229 = 100132464229201 is a prime.
It is a super-2 number, since 2×1001330011001132 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100133001100092 and 100133001100101.
It is not an unprimeable number, because it can be changed into a prime (100133001100133) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28931810203 + ... + 28931813663.
It is an arithmetic number, because the mean of its divisors is an integer number (2119906567296).
Almost surely, 2100133001100113 is an apocalyptic number.
It is an amenable number.
100133001100113 is a deficient number, since it is larger than the sum of its proper divisors (35541019206831).
100133001100113 is a wasteful number, since it uses less digits than its factorization.
100133001100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5126.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 100133001100113 its reverse (311001100331001), we get a palindrome (411134101431114).
The spelling of 100133001100113 in words is "one hundred trillion, one hundred thirty-three billion, one million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •