Base | Representation |
---|---|
bin | 1100010110100000111… |
… | …1001100101100000101 |
3 | 202021201201220021200221 |
4 | 3011220033030230011 |
5 | 11434042231241401 |
6 | 241252341504341 |
7 | 21221366020255 |
oct | 3055017145405 |
9 | 667651807627 |
10 | 212202212101 |
11 | 81aa3686810 |
12 | 351621120b1 |
13 | 1701a333b19 |
14 | a3b08d9965 |
15 | 57be8397a1 |
hex | 31683ccb05 |
212202212101 has 32 divisors (see below), whose sum is σ = 251326955520. Its totient is φ = 177097608000.
The previous prime is 212202212093. The next prime is 212202212141. The reversal of 212202212101 is 101212202212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 212202212101 - 23 = 212202212093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212202212141) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 885180 + ... + 1099066.
It is an arithmetic number, because the mean of its divisors is an integer number (7853967360).
Almost surely, 2212202212101 is an apocalyptic number.
It is an amenable number.
212202212101 is a deficient number, since it is larger than the sum of its proper divisors (39124743419).
212202212101 is a wasteful number, since it uses less digits than its factorization.
212202212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214065.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212202212101 its reverse (101212202212), we get a palindrome (313414414313).
It can be divided in two parts, 212202212 and 101, that multiplied together give a palindrome (21432423412).
The spelling of 212202212101 in words is "two hundred twelve billion, two hundred two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •