Base | Representation |
---|---|
bin | 110010010001101110000011… |
… | …001011011000101100101011 |
3 | 1001222220212101010122021212211 |
4 | 302101232003023120230223 |
5 | 212440312231014200021 |
6 | 2102141043203345551 |
7 | 64401251533165360 |
oct | 6221560313305453 |
9 | 1058825333567784 |
10 | 221120002100011 |
11 | 64501514665143 |
12 | 209726553822b7 |
13 | 964c6b02ac601 |
14 | 3c8639da1a467 |
15 | 1a86c8a9093e1 |
hex | c91b832d8b2b |
221120002100011 has 16 divisors (see below), whose sum is σ = 266112169747200. Its totient is φ = 179486469282528.
The previous prime is 221120002099991. The next prime is 221120002100027. The reversal of 221120002100011 is 110001200021122.
It is a cyclic number.
It is not a de Polignac number, because 221120002100011 - 27 = 221120002099883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221120002099964 and 221120002100000.
It is not an unprimeable number, because it can be changed into a prime (221120002100111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 321982780 + ... + 322668793.
It is an arithmetic number, because the mean of its divisors is an integer number (16632010609200).
Almost surely, 2221120002100011 is an apocalyptic number.
221120002100011 is a deficient number, since it is larger than the sum of its proper divisors (44992167647189).
221120002100011 is a wasteful number, since it uses less digits than its factorization.
221120002100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644654178.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 221120002100011 its reverse (110001200021122), we get a palindrome (331121202121133).
The spelling of 221120002100011 in words is "two hundred twenty-one trillion, one hundred twenty billion, two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •