Base | Representation |
---|---|
bin | 11001010000101110001001… |
… | …001001111010000001110001 |
3 | 112120101002002100210212100220 |
4 | 121100232021021322001301 |
5 | 104030231222322334301 |
6 | 1032142423031203253 |
7 | 32254504011324063 |
oct | 3120561111720161 |
9 | 476332070725326 |
10 | 111100220121201 |
11 | 3244437a977533 |
12 | 10563b72b16529 |
13 | 49cb92385a35c |
14 | 1d613ca747733 |
15 | cc9e89694936 |
hex | 650b8927a071 |
111100220121201 has 144 divisors (see below), whose sum is σ = 167975556368256. Its totient is φ = 65287952252928.
The previous prime is 111100220121199. The next prime is 111100220121221. The reversal of 111100220121201 is 102121022001111.
It is a happy number.
It is not a de Polignac number, because 111100220121201 - 21 = 111100220121199 is a prime.
It is a super-3 number, since 3×1111002201212013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (111100220121221) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 41501761875 + ... + 41501764551.
It is an arithmetic number, because the mean of its divisors is an integer number (1166496919224).
Almost surely, 2111100220121201 is an apocalyptic number.
It is an amenable number.
111100220121201 is a deficient number, since it is larger than the sum of its proper divisors (56875336247055).
111100220121201 is a wasteful number, since it uses less digits than its factorization.
111100220121201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4216 (or 4180 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111100220121201 its reverse (102121022001111), we get a palindrome (213221242122312).
The spelling of 111100220121201 in words is "one hundred eleven trillion, one hundred billion, two hundred twenty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •