Base | Representation |
---|---|
bin | 10110101110011111… |
… | …00000011110100101 |
3 | 1011111022112011100211 |
4 | 23113033200132211 |
5 | 144441440214341 |
6 | 5334411535421 |
7 | 611232435451 |
oct | 132717403645 |
9 | 34438464324 |
10 | 12201101221 |
11 | 51a1226a31 |
12 | 244615a571 |
13 | 11c5a1612a |
14 | 83a609661 |
15 | 4b6246181 |
hex | 2d73e07a5 |
12201101221 has 8 divisors (see below), whose sum is σ = 12522057624. Its totient is φ = 11883505920.
The previous prime is 12201101207. The next prime is 12201101291. The reversal of 12201101221 is 12210110221.
It can be written as a sum of positive squares in 4 ways, for example, as 2063430625 + 10137670596 = 45425^2 + 100686^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201101221 - 25 = 12201101189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201101291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 832920 + ... + 847441.
It is an arithmetic number, because the mean of its divisors is an integer number (1565257203).
Almost surely, 212201101221 is an apocalyptic number.
It is an amenable number.
12201101221 is a deficient number, since it is larger than the sum of its proper divisors (320956403).
12201101221 is a wasteful number, since it uses less digits than its factorization.
12201101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1680551.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12201101221 its reverse (12210110221), we get a palindrome (24411211442).
The spelling of 12201101221 in words is "twelve billion, two hundred one million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •