Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0100010000011101101 |
3 | 101122000210111011211202 |
4 | 1213210012202003231 |
5 | 3310214440200023 |
6 | 123030213255245 |
7 | 11014444516523 |
oct | 1474406420355 |
9 | 348023434752 |
10 | 111201100013 |
11 | 43184138353 |
12 | 19675034525 |
13 | a6422b7c83 |
14 | 554c91c313 |
15 | 2d5c79e128 |
hex | 19e41a20ed |
111201100013 has 8 divisors (see below), whose sum is σ = 113343489600. Its totient is φ = 109067298048.
The previous prime is 111201100001. The next prime is 111201100081. The reversal of 111201100013 is 310001102111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111201100013 - 220 = 111200051437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111201099967 and 111201100003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111201100613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2120756 + ... + 2172557.
It is an arithmetic number, because the mean of its divisors is an integer number (14167936200).
Almost surely, 2111201100013 is an apocalyptic number.
It is an amenable number.
111201100013 is a deficient number, since it is larger than the sum of its proper divisors (2142389587).
111201100013 is an equidigital number, since it uses as much as digits as its factorization.
111201100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4293811.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111201100013 its reverse (310001102111), we get a palindrome (421202202124).
The spelling of 111201100013 in words is "one hundred eleven billion, two hundred one million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •