Base | Representation |
---|---|
bin | 110000010011010001001010… |
… | …000000100100001011000111 |
3 | 1000212011010210112110112221211 |
4 | 300103101022000210023013 |
5 | 210320424300433403221 |
6 | 2031445051010552251 |
7 | 62513404315115101 |
oct | 6023211200441307 |
9 | 1025133715415854 |
10 | 212430324122311 |
11 | 61761215a13459 |
12 | 1b9aa505898687 |
13 | 916c12a877529 |
14 | 3a6597aca2571 |
15 | 1985c00ba86e1 |
hex | c1344a0242c7 |
212430324122311 has 2 divisors, whose sum is σ = 212430324122312. Its totient is φ = 212430324122310.
The previous prime is 212430324122309. The next prime is 212430324122323. The reversal of 212430324122311 is 113221423034212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212430324122311 - 21 = 212430324122309 is a prime.
Together with 212430324122309, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212430324122011) 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 as a sum of consecutive naturals, namely, 106215162061155 + 106215162061156.
It is an arithmetic number, because the mean of its divisors is an integer number (106215162061156).
Almost surely, 2212430324122311 is an apocalyptic number.
212430324122311 is a deficient number, since it is larger than the sum of its proper divisors (1).
212430324122311 is an equidigital number, since it uses as much as digits as its factorization.
212430324122311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 212430324122311 its reverse (113221423034212), we get a palindrome (325651747156523).
The spelling of 212430324122311 in words is "two hundred twelve trillion, four hundred thirty billion, three hundred twenty-four million, one hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •