Base | Representation |
---|---|
bin | 1001001100001100011100… |
… | …11101000001101110111101 |
3 | 2122120002002100201220021101 |
4 | 10212012032131001232331 |
5 | 10122111003020223004 |
6 | 110552235351333101 |
7 | 4154065604633323 |
oct | 446061635015675 |
9 | 78502070656241 |
10 | 20210211101629 |
11 | 6492114318aaa |
12 | 2324a5a981191 |
13 | b37a78c63783 |
14 | 4dc272533d13 |
15 | 250aa99b6ba4 |
hex | 12618e741bbd |
20210211101629 has 2 divisors, whose sum is σ = 20210211101630. Its totient is φ = 20210211101628.
The previous prime is 20210211101611. The next prime is 20210211101701. The reversal of 20210211101629 is 92610111201202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13550482485604 + 6659728616025 = 3681098^2 + 2580645^2 .
It is a cyclic number.
It is not a de Polignac number, because 20210211101629 - 227 = 20210076883901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20210211101597 and 20210211101606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20210211101609) 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 as a sum of consecutive naturals, namely, 10105105550814 + 10105105550815.
It is an arithmetic number, because the mean of its divisors is an integer number (10105105550815).
Almost surely, 220210211101629 is an apocalyptic number.
It is an amenable number.
20210211101629 is a deficient number, since it is larger than the sum of its proper divisors (1).
20210211101629 is an equidigital number, since it uses as much as digits as its factorization.
20210211101629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 28.
The spelling of 20210211101629 in words is "twenty trillion, two hundred ten billion, two hundred eleven million, one hundred one thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •