Base | Representation |
---|---|
bin | 11001010010001101000111… |
… | …101100100000111010001001 |
3 | 112120201211022121000222101122 |
4 | 121102031013230200322021 |
5 | 104033414101441042301 |
6 | 1032301330321525025 |
7 | 32265044131413413 |
oct | 3122150754407211 |
9 | 476654277028348 |
10 | 111202201112201 |
11 | 32483652546481 |
12 | 1057b8941a3775 |
13 | 4a084268b9b04 |
14 | 1d663029159b3 |
15 | ccc95778981b |
hex | 652347b20e89 |
111202201112201 has 16 divisors (see below), whose sum is σ = 113760112773120. Its totient is φ = 108652300810560.
The previous prime is 111202201112147. The next prime is 111202201112213. The reversal of 111202201112201 is 102211102202111.
It is a cyclic number.
It is not a de Polignac number, because 111202201112201 - 222 = 111202196917897 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111202201112201.
It is not an unprimeable number, because it can be changed into a prime (111202201112501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 816460415 + ... + 816596603.
It is an arithmetic number, because the mean of its divisors is an integer number (7110007048320).
Almost surely, 2111202201112201 is an apocalyptic number.
It is an amenable number.
111202201112201 is a deficient number, since it is larger than the sum of its proper divisors (2557911660919).
111202201112201 is a wasteful number, since it uses less digits than its factorization.
111202201112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165464.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111202201112201 its reverse (102211102202111), we get a palindrome (213413303314312).
The spelling of 111202201112201 in words is "one hundred eleven trillion, two hundred two billion, two hundred one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •