Base | Representation |
---|---|
bin | 11001100000101110011001… |
… | …001001001101100010100011 |
3 | 112201021012210220200102121110 |
4 | 121200232121021031202203 |
5 | 104201241100000032321 |
6 | 1034343545102554403 |
7 | 32430116411141232 |
oct | 3140563111154243 |
9 | 481235726612543 |
10 | 112200000002211 |
11 | 32828830a53900 |
12 | 10701140b98a03 |
13 | 4a7b550b559b4 |
14 | 1d9c71a8b2b19 |
15 | ce88a5b65176 |
hex | 660b9924d8a3 |
112200000002211 has 24 divisors (see below), whose sum is σ = 169740762483712. Its totient is φ = 65806451607600.
The previous prime is 112200000002161. The next prime is 112200000002221.
112200000002211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 112200000002211 - 26 = 112200000002147 is a prime.
It is a super-2 number, since 2×1122000000022112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (112200000002221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4985325991 + ... + 4985348496.
Almost surely, 2112200000002211 is an apocalyptic number.
112200000002211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112200000002211 is a deficient number, since it is larger than the sum of its proper divisors (57540762481501).
112200000002211 is a wasteful number, since it uses less digits than its factorization.
112200000002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9970674543 (or 9970674532 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 11220000000 and 2211, that added together give a palindrome (11220002211).
The spelling of 112200000002211 in words is "one hundred twelve trillion, two hundred billion, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •