Base | Representation |
---|---|
bin | 110010011111111110111100… |
… | …101110101100100011111100 |
3 | 1002010101120111012221010201101 |
4 | 302133332330232230203330 |
5 | 213102342222332414322 |
6 | 2104211233235222444 |
7 | 64532132334445153 |
oct | 6237767456544374 |
9 | 1063346435833641 |
10 | 222100220201212 |
11 | 6484a1a1187741 |
12 | 20ab0616447a24 |
13 | 96c0c65124892 |
14 | 3cbb9cab1259a |
15 | 1aa250a637327 |
hex | c9ffbcbac8fc |
222100220201212 has 24 divisors (see below), whose sum is σ = 409132484263440. Its totient is φ = 105205238974080.
The previous prime is 222100220201203. The next prime is 222100220201263. The reversal of 222100220201212 is 212102022001222.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 222100220201212.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95552262 + ... + 97849042.
It is an arithmetic number, because the mean of its divisors is an integer number (17047186844310).
Almost surely, 2222100220201212 is an apocalyptic number.
It is an amenable number.
222100220201212 is a deficient number, since it is larger than the sum of its proper divisors (187032264062228).
222100220201212 is a wasteful number, since it uses less digits than its factorization.
222100220201212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3569181 (or 3569179 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 222100220201212 its reverse (212102022001222), we get a palindrome (434202242202434).
The spelling of 222100220201212 in words is "two hundred twenty-two trillion, one hundred billion, two hundred twenty million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •