Base | Representation |
---|---|
bin | 11001010000101111110011… |
… | …111101110011010010110001 |
3 | 112120101020201020202022212110 |
4 | 121100233303331303102301 |
5 | 104030243410100010001 |
6 | 1032143320523515533 |
7 | 32254566301064163 |
oct | 3120576375632261 |
9 | 476336636668773 |
10 | 111102012110001 |
11 | 3244510a45a210 |
12 | 10564393088ba9 |
13 | 49cbb4aba3b63 |
14 | 1d6151a736933 |
15 | cca041b693d6 |
hex | 650bf3f734b1 |
111102012110001 has 32 divisors (see below), whose sum is σ = 170164358784000. Its totient is φ = 63769623382080.
The previous prime is 111102012109993. The next prime is 111102012110041. The reversal of 111102012110001 is 100011210201111.
It is not a de Polignac number, because 111102012110001 - 23 = 111102012109993 is a prime.
It is a super-2 number, since 2×1111020121100012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111102012110041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27268701 + ... + 31077098.
It is an arithmetic number, because the mean of its divisors is an integer number (5317636212000).
Almost surely, 2111102012110001 is an apocalyptic number.
111102012110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111102012110001 is a deficient number, since it is larger than the sum of its proper divisors (59062346673999).
111102012110001 is a wasteful number, since it uses less digits than its factorization.
111102012110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58348869.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111102012110001 its reverse (100011210201111), we get a palindrome (211113222311112).
The spelling of 111102012110001 in words is "one hundred eleven trillion, one hundred two billion, twelve million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •