Base | Representation |
---|---|
bin | 11001010011001… |
… | …10100010001001 |
3 | 112210100112000122 |
4 | 30221212202021 |
5 | 413312413304 |
6 | 33020513025 |
7 | 5154642101 |
oct | 1451464211 |
9 | 483315018 |
10 | 212232329 |
11 | a9888321 |
12 | 5b0ab775 |
13 | 34c7ac7a |
14 | 20288201 |
15 | 139739be |
hex | ca66889 |
212232329 has 2 divisors, whose sum is σ = 212232330. Its totient is φ = 212232328.
The previous prime is 212232311. The next prime is 212232331. The reversal of 212232329 is 923232212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 147671104 + 64561225 = 12152^2 + 8035^2 .
It is a cyclic number.
It is not a de Polignac number, because 212232329 - 28 = 212232073 is a prime.
It is a super-2 number, since 2×2122323292 = 90085122945528482, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 212232331, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a nialpdrome in base 11.
It is a junction number, because it is equal to n+sod(n) for n = 212232298 and 212232307.
It is not a weakly prime, because it can be changed into another prime (212232379) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106116164 + 106116165.
It is an arithmetic number, because the mean of its divisors is an integer number (106116165).
Almost surely, 2212232329 is an apocalyptic number.
It is an amenable number.
212232329 is a deficient number, since it is larger than the sum of its proper divisors (1).
212232329 is an equidigital number, since it uses as much as digits as its factorization.
212232329 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 26.
The square root of 212232329 is about 14568.1958045600. The cubic root of 212232329 is about 596.4909331657.
The spelling of 212232329 in words is "two hundred twelve million, two hundred thirty-two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •