Base | Representation |
---|---|
bin | 10001110001001001010… |
… | …010001000001110010111 |
3 | 11022201121121021212012210 |
4 | 101301021102020032113 |
5 | 130001102022413421 |
6 | 2332530355444503 |
7 | 154133344316115 |
oct | 21611122101627 |
9 | 4281547255183 |
10 | 1221000201111 |
11 | 430906866aa9 |
12 | 17877a5b6733 |
13 | 8b1a8270202 |
14 | 4314d5b0ab5 |
15 | 21b63677576 |
hex | 11c49488397 |
1221000201111 has 8 divisors (see below), whose sum is σ = 1628118645760. Its totient is φ = 813940945272.
The previous prime is 1221000201089. The next prime is 1221000201173. The reversal of 1221000201111 is 1111020001221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1221000201111 - 211 = 1221000199063 is a prime.
It is a super-2 number, since 2×12210002011112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221000271111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14749045 + ... + 14831598.
It is an arithmetic number, because the mean of its divisors is an integer number (203514830720).
Almost surely, 21221000201111 is an apocalyptic number.
1221000201111 is a deficient number, since it is larger than the sum of its proper divisors (407118444649).
1221000201111 is a wasteful number, since it uses less digits than its factorization.
1221000201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29594405.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1221000201111 its reverse (1111020001221), we get a palindrome (2332020202332).
The spelling of 1221000201111 in words is "one trillion, two hundred twenty-one billion, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •