Base | Representation |
---|---|
bin | 1100111011011011001… |
… | …0011111001000010000 |
3 | 210020022020012002012012 |
4 | 3032312302133020100 |
5 | 12114340131120422 |
6 | 250011432322052 |
7 | 22022044010021 |
oct | 3166662371020 |
9 | 706266162165 |
10 | 222110020112 |
11 | 862183525a2 |
12 | 37068243328 |
13 | 17c38bb2706 |
14 | aa70700c48 |
15 | 5b9e5864e2 |
hex | 33b6c9f210 |
222110020112 has 20 divisors (see below), whose sum is σ = 430550320620. Its totient is φ = 111000259968.
The previous prime is 222110020073. The next prime is 222110020183. The reversal of 222110020112 is 211020011222.
222110020112 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 156565827856 + 65544192256 = 395684^2 + 256016^2 .
It is a super-2 number, since 2×2221100201122 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3388403 + ... + 3453330.
It is an arithmetic number, because the mean of its divisors is an integer number (21527516031).
Almost surely, 2222110020112 is an apocalyptic number.
It is an amenable number.
222110020112 is a deficient number, since it is larger than the sum of its proper divisors (208440300508).
222110020112 is a wasteful number, since it uses less digits than its factorization.
222110020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6843770 (or 6843764 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 222110020112 its reverse (211020011222), we get a palindrome (433130031334).
The spelling of 222110020112 in words is "two hundred twenty-two billion, one hundred ten million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •