Base | Representation |
---|---|
bin | 1011111111100100100… |
… | …0000100101011010001 |
3 | 201200211111110021111012 |
4 | 2333321020010223101 |
5 | 11333434013343001 |
6 | 234353242500305 |
7 | 20612640334565 |
oct | 2777110045321 |
9 | 650744407435 |
10 | 206043106001 |
11 | 7a422a64187 |
12 | 33b23504695 |
13 | 165782cb445 |
14 | 9d889116a5 |
15 | 555dc742bb |
hex | 2ff9204ad1 |
206043106001 has 2 divisors, whose sum is σ = 206043106002. Its totient is φ = 206043106000.
The previous prime is 206043105997. The next prime is 206043106021. The reversal of 206043106001 is 100601340602.
It is a happy number.
206043106001 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., 110902320400 + 95140785601 = 333020^2 + 308449^2 .
It is a cyclic number.
It is not a de Polignac number, because 206043106001 - 22 = 206043105997 is a prime.
It is not a weakly prime, because it can be changed into another prime (206043106021) 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, 103021553000 + 103021553001.
It is an arithmetic number, because the mean of its divisors is an integer number (103021553001).
Almost surely, 2206043106001 is an apocalyptic number.
It is an amenable number.
206043106001 is a deficient number, since it is larger than the sum of its proper divisors (1).
206043106001 is an equidigital number, since it uses as much as digits as its factorization.
206043106001 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 23.
Adding to 206043106001 its reverse (100601340602), we get a palindrome (306644446603).
The spelling of 206043106001 in words is "two hundred six billion, forty-three million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •