Base | Representation |
---|---|
bin | 110010010110000111111010… |
… | …000100000001110001111001 |
3 | 1002000222210112210110120101212 |
4 | 302112013322010001301321 |
5 | 213010242033424324203 |
6 | 2102532054125452505 |
7 | 64432154354064503 |
oct | 6226077204016171 |
9 | 1060883483416355 |
10 | 221422644370553 |
11 | 646088a82a83aa |
12 | 20a01237711135 |
13 | 96720b16612c2 |
14 | 3c96cada44d73 |
15 | 1a8eaa00481d8 |
hex | c961fa101c79 |
221422644370553 has 8 divisors (see below), whose sum is σ = 226938037312800. Its totient is φ = 215923889115648.
The previous prime is 221422644370549. The next prime is 221422644370559. The reversal of 221422644370553 is 355073446224122.
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 221422644370553 - 22 = 221422644370549 is a prime.
It is a super-2 number, since 2×2214226443705532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221422644370559) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4159394888 + ... + 4159448121.
It is an arithmetic number, because the mean of its divisors is an integer number (28367254664100).
Almost surely, 2221422644370553 is an apocalyptic number.
It is an amenable number.
221422644370553 is a deficient number, since it is larger than the sum of its proper divisors (5515392942247).
221422644370553 is an equidigital number, since it uses as much as digits as its factorization.
221422644370553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8318843671.
The product of its (nonzero) digits is 9676800, while the sum is 50.
The spelling of 221422644370553 in words is "two hundred twenty-one trillion, four hundred twenty-two billion, six hundred forty-four million, three hundred seventy thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •