Base | Representation |
---|---|
bin | 110010010011000010111111… |
… | …000011111111111110111101 |
3 | 1002000020120202221200000102122 |
4 | 302103002333003333332331 |
5 | 212443311014441004244 |
6 | 2102251004534532325 |
7 | 64410660532034621 |
oct | 6223027703777675 |
9 | 1060216687600378 |
10 | 221211201109949 |
11 | 64537164076136 |
12 | 209882678070a5 |
13 | 965818563a50b |
14 | 3c8a971c6b181 |
15 | 1a893271781ee |
hex | c930bf0fffbd |
221211201109949 has 2 divisors, whose sum is σ = 221211201109950. Its totient is φ = 221211201109948.
The previous prime is 221211201109931. The next prime is 221211201110021. The reversal of 221211201109949 is 949901102112122.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207300964202500 + 13910236907449 = 14397950^2 + 3729643^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221211201109949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221211201109049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110605600554974 + 110605600554975.
It is an arithmetic number, because the mean of its divisors is an integer number (110605600554975).
Almost surely, 2221211201109949 is an apocalyptic number.
It is an amenable number.
221211201109949 is a deficient number, since it is larger than the sum of its proper divisors (1).
221211201109949 is an equidigital number, since it uses as much as digits as its factorization.
221211201109949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 44.
The spelling of 221211201109949 in words is "two hundred twenty-one trillion, two hundred eleven billion, two hundred one million, one hundred nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •