Base | Representation |
---|---|
bin | 1100110111101111000… |
… | …1111100001011011001 |
3 | 210010202020022221000011 |
4 | 3031323301330023121 |
5 | 12110323211134314 |
6 | 245325305241521 |
7 | 21655363111603 |
oct | 3157361741331 |
9 | 703666287004 |
10 | 221120021209 |
11 | 8585a53a78a |
12 | 36a307932a1 |
13 | 17b0ba67749 |
14 | a9b9038173 |
15 | 5b426cd4c4 |
hex | 337bc7c2d9 |
221120021209 has 8 divisors (see below), whose sum is σ = 226572143112. Its totient is φ = 215670706560.
The previous prime is 221120021191. The next prime is 221120021219. The reversal of 221120021209 is 902120021122.
It can be written as a sum of positive squares in 4 ways, for example, as 2818017225 + 218302003984 = 53085^2 + 467228^2 .
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 221120021209 - 27 = 221120021081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221120021209.
It is not an unprimeable number, because it can be changed into a prime (221120021219) 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 7 ways as a sum of consecutive naturals, for example, 541894 + ... + 857839.
It is an arithmetic number, because the mean of its divisors is an integer number (28321517889).
Almost surely, 2221120021209 is an apocalyptic number.
It is an amenable number.
221120021209 is a deficient number, since it is larger than the sum of its proper divisors (5452121903).
221120021209 is a wasteful number, since it uses less digits than its factorization.
221120021209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1403627.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 221120021209 in words is "two hundred twenty-one billion, one hundred twenty million, twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •