Base | Representation |
---|---|
bin | 110011110010000011… |
… | …1101110010001101001 |
3 | 101122000211002001002021 |
4 | 1213210013232101221 |
5 | 3310220030142301 |
6 | 123030224104441 |
7 | 11014450256635 |
oct | 1474407562151 |
9 | 348024061067 |
10 | 111201412201 |
11 | 43184330960 |
12 | 19675165121 |
13 | a6423970b9 |
14 | 554c99ddc5 |
15 | 2d5c8118a1 |
hex | 19e41ee469 |
111201412201 has 8 divisors (see below), whose sum is σ = 124589297664. Its totient is φ = 98359971120.
The previous prime is 111201412193. The next prime is 111201412213. The reversal of 111201412201 is 102214102111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111201412201 - 23 = 111201412193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111201412291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136610665 + ... + 136611478.
It is an arithmetic number, because the mean of its divisors is an integer number (15573662208).
Almost surely, 2111201412201 is an apocalyptic number.
111201412201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111201412201 is a deficient number, since it is larger than the sum of its proper divisors (13387885463).
111201412201 is a wasteful number, since it uses less digits than its factorization.
111201412201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273222191.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 111201412201 its reverse (102214102111), we get a palindrome (213415514312).
The spelling of 111201412201 in words is "one hundred eleven billion, two hundred one million, four hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •