Base | Representation |
---|---|
bin | 101101101110100100010110… |
… | …100011110011110010010111 |
3 | 222101002010210112202220112102 |
4 | 231232210112203303302113 |
5 | 202330010312330333421 |
6 | 1551421402425312315 |
7 | 60234610226335310 |
oct | 5556442643636227 |
9 | 871063715686472 |
10 | 201112222121111 |
11 | 5909823a447884 |
12 | 1a680a9033569b |
13 | 882aa5522c982 |
14 | 3793c52409607 |
15 | 183b5cca3960b |
hex | b6e9168f3c97 |
201112222121111 has 16 divisors (see below), whose sum is σ = 232299127646208. Its totient is φ = 170542124196000.
The previous prime is 201112222121033. The next prime is 201112222121141. The reversal of 201112222121111 is 111121222211102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201112222121111 - 230 = 201111148379287 is a prime.
It is a super-2 number, since 2×2011122221211112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201112222121141) 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, 109949735 + ... + 111763896.
It is an arithmetic number, because the mean of its divisors is an integer number (14518695477888).
Almost surely, 2201112222121111 is an apocalyptic number.
201112222121111 is a deficient number, since it is larger than the sum of its proper divisors (31186905525097).
201112222121111 is a wasteful number, since it uses less digits than its factorization.
201112222121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221715022.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 201112222121111 its reverse (111121222211102), we get a palindrome (312233444332213).
The spelling of 201112222121111 in words is "two hundred one trillion, one hundred twelve billion, two hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •