Base | Representation |
---|---|
bin | 1100111011011101110… |
… | …1001001000111000000 |
3 | 210020100000020012000100 |
4 | 3032313131021013000 |
5 | 12114401011431422 |
6 | 250012512122400 |
7 | 22022241031425 |
oct | 3166735110700 |
9 | 706300205010 |
10 | 222121202112 |
11 | 8622369a817 |
12 | 3706bb36400 |
13 | 17c3b2c9294 |
14 | aa71db1d4c |
15 | 5ba05447ac |
hex | 33b77491c0 |
222121202112 has 42 divisors (see below), whose sum is σ = 636670322288. Its totient is φ = 74040400512.
The previous prime is 222121202111. The next prime is 222121202131. The reversal of 222121202112 is 211202121222.
It is a happy number.
222121202112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222121202111) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 192812968 + ... + 192814119.
Almost surely, 2222121202112 is an apocalyptic number.
It is an amenable number.
222121202112 is an abundant number, since it is smaller than the sum of its proper divisors (414549120176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222121202112 is a wasteful number, since it uses less digits than its factorization.
222121202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385627105 (or 385627092 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 222121202112 its reverse (211202121222), we get a palindrome (433323323334).
The spelling of 222121202112 in words is "two hundred twenty-two billion, one hundred twenty-one million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •