Base | Representation |
---|---|
bin | 110010010100011001101101… |
… | …011001101011110001010010 |
3 | 1002000120111010120221012001112 |
4 | 302110121231121223301102 |
5 | 213001322222001434442 |
6 | 2102401445023133322 |
7 | 64420465235332502 |
oct | 6224315531536122 |
9 | 1060514116835045 |
10 | 221304320343122 |
11 | 645726a9495285 |
12 | 209a2315144242 |
13 | 9663ba575cba3 |
14 | 3c9128712ba02 |
15 | 1a8b97729c082 |
hex | c9466d66bc52 |
221304320343122 has 8 divisors (see below), whose sum is σ = 332304808408956. Its totient is φ = 110536050873472.
The previous prime is 221304320343049. The next prime is 221304320343163. The reversal of 221304320343122 is 221343023403122.
221304320343122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 207835501083001 + 13468819260121 = 14416501^2 + 3669989^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×2213043203431224 (a number of 58 digits) contains 4444 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58054646663 + ... + 58054650474.
Almost surely, 2221304320343122 is an apocalyptic number.
221304320343122 is a deficient number, since it is larger than the sum of its proper divisors (111000488065834).
221304320343122 is a wasteful number, since it uses less digits than its factorization.
221304320343122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116109298092.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 221304320343122 its reverse (221343023403122), we get a palindrome (442647343746244).
The spelling of 221304320343122 in words is "two hundred twenty-one trillion, three hundred four billion, three hundred twenty million, three hundred forty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •