Base | Representation |
---|---|
bin | 1100010110100000111… |
… | …1001100101100010001 |
3 | 202021201201220021201101 |
4 | 3011220033030230101 |
5 | 11434042231241423 |
6 | 241252341504401 |
7 | 21221366020303 |
oct | 3055017145421 |
9 | 667651807641 |
10 | 212202212113 |
11 | 81aa3686821 |
12 | 35162112101 |
13 | 1701a333b28 |
14 | a3b08d9973 |
15 | 57be8397ad |
hex | 31683ccb11 |
212202212113 has 8 divisors (see below), whose sum is σ = 213622435520. Its totient is φ = 210782185200.
The previous prime is 212202212093. The next prime is 212202212141. The reversal of 212202212113 is 311212202212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212202212113 - 25 = 212202212081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212202212813) 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 7 ways as a sum of consecutive naturals, for example, 2589931 + ... + 2670607.
It is an arithmetic number, because the mean of its divisors is an integer number (26702804440).
Almost surely, 2212202212113 is an apocalyptic number.
It is an amenable number.
212202212113 is a deficient number, since it is larger than the sum of its proper divisors (1420223407).
212202212113 is a wasteful number, since it uses less digits than its factorization.
212202212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98247.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 212202212113 its reverse (311212202212), we get a palindrome (523414414325).
Subtracting 212202212113 from its reverse (311212202212), we obtain a palindrome (99009990099).
The spelling of 212202212113 in words is "two hundred twelve billion, two hundred two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •