Base | Representation |
---|---|
bin | 10110101110011110… |
… | …01101001010011111 |
3 | 1011111022101010211211 |
4 | 23113033031022133 |
5 | 144441430201421 |
6 | 5334410125251 |
7 | 611231656015 |
oct | 132717151237 |
9 | 34438333754 |
10 | 12201022111 |
11 | 51a1182553 |
12 | 2446120827 |
13 | 11c59b9115 |
14 | 83a5c88b5 |
15 | 4b622c9e1 |
hex | 2d73cd29f |
12201022111 has 12 divisors (see below), whose sum is σ = 13034297952. Its totient is φ = 11381490176.
The previous prime is 12201022091. The next prime is 12201022117. The reversal of 12201022111 is 11122010221.
It is not a de Polignac number, because 12201022111 - 27 = 12201021983 is a prime.
It is a super-2 number, since 2×122010221112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201022091 and 12201022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201022117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 188970 + ... + 245176.
It is an arithmetic number, because the mean of its divisors is an integer number (1086191496).
Almost surely, 212201022111 is an apocalyptic number.
12201022111 is a deficient number, since it is larger than the sum of its proper divisors (833275841).
12201022111 is an equidigital number, since it uses as much as digits as its factorization.
12201022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56450 (or 56337 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12201022111 its reverse (11122010221), we get a palindrome (23323032332).
It can be divided in two parts, 122010221 and 11, that multiplied together give a palindrome (1342112431).
The spelling of 12201022111 in words is "twelve billion, two hundred one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •