Base | Representation |
---|---|
bin | 11001010001011… |
… | …10000011111001 |
3 | 112202220202201112 |
4 | 30220232003321 |
5 | 413233013032 |
6 | 33011530105 |
7 | 5152656524 |
oct | 1450560371 |
9 | 482822645 |
10 | 212001017 |
11 | a973a558 |
12 | 5abb9935 |
13 | 34bc98b7 |
14 | 20227bbb |
15 | 1392a1b2 |
hex | ca2e0f9 |
212001017 has 2 divisors, whose sum is σ = 212001018. Its totient is φ = 212001016.
The previous prime is 212001001. The next prime is 212001019. The reversal of 212001017 is 710100212.
212001017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125529616 + 86471401 = 11204^2 + 9299^2 .
It is a cyclic number.
It is not a de Polignac number, because 212001017 - 24 = 212001001 is a prime.
Together with 212001019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 212000992 and 212001010.
It is not a weakly prime, because it can be changed into another prime (212001019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106000508 + 106000509.
It is an arithmetic number, because the mean of its divisors is an integer number (106000509).
Almost surely, 2212001017 is an apocalyptic number.
It is an amenable number.
212001017 is a deficient number, since it is larger than the sum of its proper divisors (1).
212001017 is an equidigital number, since it uses as much as digits as its factorization.
212001017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 14.
The square root of 212001017 is about 14560.2547024425. The cubic root of 212001017 is about 596.2741492474.
Adding to 212001017 its reverse (710100212), we get a palindrome (922101229).
The spelling of 212001017 in words is "two hundred twelve million, one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •