Base | Representation |
---|---|
bin | 110010010001100100101110… |
… | …111111110101000110000001 |
3 | 1001222212220120001122100010102 |
4 | 302101210232333311012001 |
5 | 212440131234430143412 |
6 | 2102132310500412145 |
7 | 64400445630362246 |
oct | 6221445677650601 |
9 | 1058786501570112 |
10 | 221109999849857 |
11 | 644a82516535a8 |
12 | 209707236a7055 |
13 | 964b777cb4bb1 |
14 | 3c85ad146d5cd |
15 | 1a868a27548c2 |
hex | c9192eff5181 |
221109999849857 has 2 divisors, whose sum is σ = 221109999849858. Its totient is φ = 221109999849856.
The previous prime is 221109999849853. The next prime is 221109999849877. The reversal of 221109999849857 is 758948999901122.
221109999849857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145147340339521 + 75962659510336 = 12047711^2 + 8715656^2 .
It is a cyclic number.
It is not a de Polignac number, because 221109999849857 - 22 = 221109999849853 is a prime.
It is not a weakly prime, because it can be changed into another prime (221109999849853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110554999924928 + 110554999924929.
It is an arithmetic number, because the mean of its divisors is an integer number (110554999924929).
Almost surely, 2221109999849857 is an apocalyptic number.
It is an amenable number.
221109999849857 is a deficient number, since it is larger than the sum of its proper divisors (1).
221109999849857 is an equidigital number, since it uses as much as digits as its factorization.
221109999849857 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2116316160, while the sum is 83.
The spelling of 221109999849857 in words is "two hundred twenty-one trillion, one hundred nine billion, nine hundred ninety-nine million, eight hundred forty-nine thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •