Base | Representation |
---|---|
bin | 110000001110011101101110… |
… | …010010000111011001001001 |
3 | 1000210222120202000201220000221 |
4 | 300032131232102013121021 |
5 | 210300022222334033001 |
6 | 2031033255050430041 |
7 | 62450510116212340 |
oct | 6016355622073111 |
9 | 1023876660656027 |
10 | 212100220221001 |
11 | 6164421a967582 |
12 | 1b95653a732321 |
13 | 9146c70ca5388 |
14 | 3a539c39cab57 |
15 | 197c3306ea1a1 |
hex | c0e76e487649 |
212100220221001 has 16 divisors (see below), whose sum is σ = 245130272870400. Its totient is φ = 179752779917568.
The previous prime is 212100220220989. The next prime is 212100220221037. The reversal of 212100220221001 is 100122022001212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 212100220221001 - 25 = 212100220220969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212100220222001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19437816 + ... + 28320118.
It is an arithmetic number, because the mean of its divisors is an integer number (15320642054400).
Almost surely, 2212100220221001 is an apocalyptic number.
It is an amenable number.
212100220221001 is a deficient number, since it is larger than the sum of its proper divisors (33030052649399).
212100220221001 is an equidigital number, since it uses as much as digits as its factorization.
212100220221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8920728.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212100220221001 its reverse (100122022001212), we get a palindrome (312222242222213).
The spelling of 212100220221001 in words is "two hundred twelve trillion, one hundred billion, two hundred twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •