Base | Representation |
---|---|
bin | 11001010001000010100111… |
… | …010100110001010110100011 |
3 | 112120110011211020221102010102 |
4 | 121101002213110301112203 |
5 | 104031111231441402321 |
6 | 1032200500124253015 |
7 | 32256212506623116 |
oct | 3121024724612643 |
9 | 476404736842112 |
10 | 111122201122211 |
11 | 3245272a646974 |
12 | 105682883a116b |
13 | 4a00a17789726 |
14 | 1d624b3b8057d |
15 | cca8242bdc0b |
hex | 6510a75315a3 |
111122201122211 has 16 divisors (see below), whose sum is σ = 117168633907200. Its totient is φ = 105095687865408.
The previous prime is 111122201122189. The next prime is 111122201122277. The reversal of 111122201122211 is 112221102221111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111122201122211 - 210 = 111122201121187 is a prime.
It is a super-2 number, since 2×1111222011222112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111122201022211) 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, 29006615 + ... + 32613311.
It is an arithmetic number, because the mean of its divisors is an integer number (7323039619200).
Almost surely, 2111122201122211 is an apocalyptic number.
111122201122211 is a deficient number, since it is larger than the sum of its proper divisors (6046432784989).
111122201122211 is a wasteful number, since it uses less digits than its factorization.
111122201122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3609458.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 111122201122211 its reverse (112221102221111), we get a palindrome (223343303343322).
The spelling of 111122201122211 in words is "one hundred eleven trillion, one hundred twenty-two billion, two hundred one million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •