Base | Representation |
---|---|
bin | 100000010100100101001… |
… | …100000100000001010101 |
3 | 21212100002210220212202101 |
4 | 200110211030010001111 |
5 | 242342324213324341 |
6 | 4420211441042101 |
7 | 316320321405511 |
oct | 40244514040125 |
9 | 7770083825671 |
10 | 2221122011221 |
11 | 786a7751a703 |
12 | 2ba575326331 |
13 | 1315b2847829 |
14 | 79707c85141 |
15 | 3cb9a950831 |
hex | 20525304055 |
2221122011221 has 8 divisors (see below), whose sum is σ = 2317884226560. Its totient is φ = 2124375770352.
The previous prime is 2221122011209. The next prime is 2221122011257. The reversal of 2221122011221 is 1221102211222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2221122011221 - 27 = 2221122011093 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 (2221122011621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3709045 + ... + 4266058.
It is an arithmetic number, because the mean of its divisors is an integer number (289735528320).
Almost surely, 22221122011221 is an apocalyptic number.
It is an amenable number.
2221122011221 is a deficient number, since it is larger than the sum of its proper divisors (96762215339).
2221122011221 is a wasteful number, since it uses less digits than its factorization.
2221122011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7987235.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 2221122011221 its reverse (1221102211222), we get a palindrome (3442224222443).
The spelling of 2221122011221 in words is "two trillion, two hundred twenty-one billion, one hundred twenty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •