Base | Representation |
---|---|
bin | 1100010110100000101… |
… | …0111101011011001001 |
3 | 202021201122210211120002 |
4 | 3011220022331123021 |
5 | 11434041440213001 |
6 | 241252302012345 |
7 | 21221353412021 |
oct | 3055012753311 |
9 | 667648724502 |
10 | 212201101001 |
11 | 81aa2a97a4a |
12 | 351618770b5 |
13 | 1701a035176 |
14 | a3b06caa81 |
15 | 57be6ba46b |
hex | 31682bd6c9 |
212201101001 has 2 divisors, whose sum is σ = 212201101002. Its totient is φ = 212201101000.
The previous prime is 212201100989. The next prime is 212201101031. The reversal of 212201101001 is 100101102212.
212201101001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 206912175376 + 5288925625 = 454876^2 + 72725^2 .
It is a cyclic number.
It is not a de Polignac number, because 212201101001 - 222 = 212196906697 is a prime.
It is not a weakly prime, because it can be changed into another prime (212201101031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106100550500 + 106100550501.
It is an arithmetic number, because the mean of its divisors is an integer number (106100550501).
Almost surely, 2212201101001 is an apocalyptic number.
It is an amenable number.
212201101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
212201101001 is an equidigital number, since it uses as much as digits as its factorization.
212201101001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 212201101001 its reverse (100101102212), we get a palindrome (312302203213).
The spelling of 212201101001 in words is "two hundred twelve billion, two hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •