Base | Representation |
---|---|
bin | 1011000111010011011111… |
… | …1011100111101100110111 |
3 | 1121021020021012022121112111 |
4 | 2301310313323213230313 |
5 | 3100203301301124421 |
6 | 41553502404431451 |
7 | 2400605654662555 |
oct | 261646773475467 |
9 | 47236235277474 |
10 | 12220120333111 |
11 | 3991584394079 |
12 | 14544116a8587 |
13 | 6a84772c90c2 |
14 | 303657d4abd5 |
15 | 162d1797eee1 |
hex | b1d37ee7b37 |
12220120333111 has 4 divisors (see below), whose sum is σ = 12227772257272. Its totient is φ = 12212468408952.
The previous prime is 12220120333103. The next prime is 12220120333117. The reversal of 12220120333111 is 11133302102221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12220120333111 - 23 = 12220120333103 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 (12220120333117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3825959685 + ... + 3825962878.
It is an arithmetic number, because the mean of its divisors is an integer number (3056943064318).
Almost surely, 212220120333111 is an apocalyptic number.
12220120333111 is a deficient number, since it is larger than the sum of its proper divisors (7651924161).
12220120333111 is an equidigital number, since it uses as much as digits as its factorization.
12220120333111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7651924160.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12220120333111 its reverse (11133302102221), we get a palindrome (23353422435332).
The spelling of 12220120333111 in words is "twelve trillion, two hundred twenty billion, one hundred twenty million, three hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •