Base | Representation |
---|---|
bin | 1011000111010011110010… |
… | …1011111010010011110111 |
3 | 1121021020110202102020122212 |
4 | 2301310330223322103313 |
5 | 3100203432211213421 |
6 | 41553514334244035 |
7 | 2400610644001412 |
oct | 261647453722367 |
9 | 47236422366585 |
10 | 12220200101111 |
11 | 3991615416a42 |
12 | 145443435661b |
13 | 6a848a9a79c2 |
14 | 303664792b79 |
15 | 162d1e989e5b |
hex | b1d3cafa4f7 |
12220200101111 has 8 divisors (see below), whose sum is σ = 12264353174400. Its totient is φ = 12176079581952.
The previous prime is 12220200101101. The next prime is 12220200101143. The reversal of 12220200101111 is 11110100202221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220200101111 is a prime.
It is a super-2 number, since 2×122202001011112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220200101101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7386290 + ... + 8888063.
It is an arithmetic number, because the mean of its divisors is an integer number (1533044146800).
Almost surely, 212220200101111 is an apocalyptic number.
12220200101111 is a deficient number, since it is larger than the sum of its proper divisors (44153073289).
12220200101111 is a wasteful number, since it uses less digits than its factorization.
12220200101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16277065.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12220200101111 its reverse (11110100202221), we get a palindrome (23330300303332).
The spelling of 12220200101111 in words is "twelve trillion, two hundred twenty billion, two hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •