Base | Representation |
---|---|
bin | 1011000110001101000101… |
… | …1001010101111001111111 |
3 | 1121012102111000101110220122 |
4 | 2301203101121111321333 |
5 | 3044401044332431421 |
6 | 41541055125205155 |
7 | 2366336416345043 |
oct | 261432131257177 |
9 | 47172430343818 |
10 | 12201220202111 |
11 | 398456579a9a6 |
12 | 1450817b607bb |
13 | 6a6754757635 |
14 | 302783b6c023 |
15 | 1625ad5712ab |
hex | b18d1655e7f |
12201220202111 has 4 divisors (see below), whose sum is σ = 12202610029800. Its totient is φ = 12199830374424.
The previous prime is 12201220202107. The next prime is 12201220202177. The reversal of 12201220202111 is 11120202210221.
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 12201220202111 - 22 = 12201220202107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12201220202111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201220202011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 694900676 + ... + 694918233.
It is an arithmetic number, because the mean of its divisors is an integer number (3050652507450).
Almost surely, 212201220202111 is an apocalyptic number.
12201220202111 is a deficient number, since it is larger than the sum of its proper divisors (1389827689).
12201220202111 is an equidigital number, since it uses as much as digits as its factorization.
12201220202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389827688.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12201220202111 its reverse (11120202210221), we get a palindrome (23321422412332).
The spelling of 12201220202111 in words is "twelve trillion, two hundred one billion, two hundred twenty million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •