Base | Representation |
---|---|
bin | 11001010010011110110101… |
… | …010100100101011011011001 |
3 | 112120210122102001210212002101 |
4 | 121102132311110211123121 |
5 | 104034222024332432301 |
6 | 1032314153451003401 |
7 | 32266316343125404 |
oct | 3122366524453331 |
9 | 476718361725071 |
10 | 111221220202201 |
11 | 3249072230027a |
12 | 10583501739561 |
13 | 4a0a167cac715 |
14 | 1d671c881cd3b |
15 | ccd1bc345701 |
hex | 6527b55256d9 |
111221220202201 has 4 divisors (see below), whose sum is σ = 111221686380672. Its totient is φ = 111220754023732.
The previous prime is 111221220202189. The next prime is 111221220202207. The reversal of 111221220202201 is 102202022122111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111221220202201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111221220202207) 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, 232731181 + ... + 233208586.
It is an arithmetic number, because the mean of its divisors is an integer number (27805421595168).
Almost surely, 2111221220202201 is an apocalyptic number.
It is an amenable number.
111221220202201 is a deficient number, since it is larger than the sum of its proper divisors (466178471).
111221220202201 is an equidigital number, since it uses as much as digits as its factorization.
111221220202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466178470.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 111221220202201 its reverse (102202022122111), we get a palindrome (213423242324312).
The spelling of 111221220202201 in words is "one hundred eleven trillion, two hundred twenty-one billion, two hundred twenty million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •