Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1100011001111100100011 |
3 | 1121021020112020010021221002 |
4 | 2301310331330121330203 |
5 | 3100204003111432321 |
6 | 41553520410422215 |
7 | 2400611321234561 |
oct | 261647574317443 |
9 | 47236466107832 |
10 | 12220221202211 |
11 | 3991626319570 |
12 | 145443b43196b |
13 | 6a8492185369 |
14 | 3036674c6a31 |
15 | 162d2175720b |
hex | b1d3df19f23 |
12220221202211 has 8 divisors (see below), whose sum is σ = 13331175825648. Its totient is φ = 11109270816000.
The previous prime is 12220221202181. The next prime is 12220221202213. The reversal of 12220221202211 is 11220212202221.
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-12220221202211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12220221202213) 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, 9906191 + ... + 11071271.
It is an arithmetic number, because the mean of its divisors is an integer number (1666396978206).
Almost surely, 212220221202211 is an apocalyptic number.
12220221202211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12220221202211 is a deficient number, since it is larger than the sum of its proper divisors (1110954623437).
12220221202211 is a wasteful number, since it uses less digits than its factorization.
12220221202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2118613.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12220221202211 its reverse (11220212202221), we get a palindrome (23440433404432).
The spelling of 12220221202211 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •