Base | Representation |
---|---|
bin | 110000001110111100011110… |
… | …100111010100010101010000 |
3 | 1000211002201222110120011012112 |
4 | 300032330132213110111100 |
5 | 210301042340243340422 |
6 | 2031100355554444452 |
7 | 62453056345123463 |
oct | 6016743647242520 |
9 | 1024081873504175 |
10 | 212133243340112 |
11 | 61657226621756 |
12 | 1b960a15b93728 |
13 | 914a104787a43 |
14 | 3a554377392da |
15 | 197d114932ee2 |
hex | c0ef1e9d4550 |
212133243340112 has 20 divisors (see below), whose sum is σ = 412772142493620. Its totient is φ = 105611400115968.
The previous prime is 212133243340021. The next prime is 212133243340141. The reversal of 212133243340112 is 211043342331212.
It can be written as a sum of positive squares in 2 ways, for example, as 115829167660816 + 96304075679296 = 10762396^2 + 9813464^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28451343287 + ... + 28451350742.
It is an arithmetic number, because the mean of its divisors is an integer number (20638607124681).
Almost surely, 2212133243340112 is an apocalyptic number.
It is an amenable number.
212133243340112 is a deficient number, since it is larger than the sum of its proper divisors (200638899153508).
212133243340112 is a wasteful number, since it uses less digits than its factorization.
212133243340112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56902694270 (or 56902694264 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 212133243340112 its reverse (211043342331212), we get a palindrome (423176585671324).
The spelling of 212133243340112 in words is "two hundred twelve trillion, one hundred thirty-three billion, two hundred forty-three million, three hundred forty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •