Base | Representation |
---|---|
bin | 11001100000101111011010… |
… | …110101110011011111000011 |
3 | 112201021022122201200102211121 |
4 | 121200233122311303133003 |
5 | 104201300324131223021 |
6 | 1034344250315053111 |
7 | 32430155623564042 |
oct | 3140573265633703 |
9 | 481238581612747 |
10 | 112201102211011 |
11 | 32829247137670 |
12 | 107013aa141197 |
13 | 4a7b6982cab58 |
14 | 1d9c7c3028559 |
15 | ce891c7d5741 |
hex | 660bdad737c3 |
112201102211011 has 4 divisors (see below), whose sum is σ = 122401202412024. Its totient is φ = 102001002010000.
The previous prime is 112201102210991. The next prime is 112201102211203. The reversal of 112201102211011 is 110112201102211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112201102211011 - 235 = 112166742472643 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112201102251011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100050100490 + ... + 5100050100511.
It is an arithmetic number, because the mean of its divisors is an integer number (30600300603006).
Almost surely, 2112201102211011 is an apocalyptic number.
112201102211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112201102211011 is a deficient number, since it is larger than the sum of its proper divisors (10200100201013).
112201102211011 is a wasteful number, since it uses less digits than its factorization.
112201102211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10200100201012.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112201102211011 its reverse (110112201102211), we get a palindrome (222313303313222).
The spelling of 112201102211011 in words is "one hundred twelve trillion, two hundred one billion, one hundred two million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •