Base | Representation |
---|---|
bin | 110000001110111010100101… |
… | …011111110100110111111001 |
3 | 1000211002112201211222111122001 |
4 | 300032322211133310313321 |
5 | 210301024210100124423 |
6 | 2031055422205501001 |
7 | 62452655112264022 |
oct | 6016724537646771 |
9 | 1024075654874561 |
10 | 212131211333113 |
11 | 61656383603826 |
12 | 1b960549571761 |
13 | 9149b6c7b5037 |
14 | 3a552c390bc49 |
15 | 197d04634bcad |
hex | c0eea57f4df9 |
212131211333113 has 16 divisors (see below), whose sum is σ = 220124491145856. Its totient is φ = 204277095146880.
The previous prime is 212131211333089. The next prime is 212131211333117. The reversal of 212131211333113 is 311333112131212.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212131211333113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212131211333117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 272051245 + ... + 272829877.
It is an arithmetic number, because the mean of its divisors is an integer number (13757780696616).
Almost surely, 2212131211333113 is an apocalyptic number.
It is an amenable number.
212131211333113 is a deficient number, since it is larger than the sum of its proper divisors (7993279812743).
212131211333113 is an equidigital number, since it uses as much as digits as its factorization.
212131211333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867984.
The product of its digits is 1944, while the sum is 28.
Adding to 212131211333113 its reverse (311333112131212), we get a palindrome (523464323464325).
The spelling of 212131211333113 in words is "two hundred twelve trillion, one hundred thirty-one billion, two hundred eleven million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •