Base | Representation |
---|---|
bin | 110010100000000000101100… |
… | …110001101011001010100000 |
3 | 1002010101202100020011100011222 |
4 | 302200000230301223022200 |
5 | 213102410100101430422 |
6 | 2104212143550354212 |
7 | 64532230041643661 |
oct | 6240005461531240 |
9 | 1063352306140158 |
10 | 222102100030112 |
11 | 6484aa76305a45 |
12 | 20ab0a5babb968 |
13 | 96c11a4715183 |
14 | 3cbbb28649368 |
15 | 1aa25ba6ad842 |
hex | ca002cc6b2a0 |
222102100030112 has 24 divisors (see below), whose sum is σ = 462984892343316. Its totient is φ = 104518635308032.
The previous prime is 222102100030087. The next prime is 222102100030219. The reversal of 222102100030112 is 211030001201222.
It can be written as a sum of positive squares in 2 ways, for example, as 214018291044496 + 8083808985616 = 14629364^2 + 2843204^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 204137959043 + ... + 204137960130.
Almost surely, 2222102100030112 is an apocalyptic number.
It is an amenable number.
222102100030112 is an abundant number, since it is smaller than the sum of its proper divisors (240882792313204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222102100030112 is a wasteful number, since it uses less digits than its factorization.
222102100030112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408275919200 (or 408275919192 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 222102100030112 its reverse (211030001201222), we get a palindrome (433132101231334).
The spelling of 222102100030112 in words is "two hundred twenty-two trillion, one hundred two billion, one hundred million, thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •