Base | Representation |
---|---|
bin | 101110110111111100111101… |
… | …010101010110001001010101 |
3 | 1000000221020111212002000220021 |
4 | 232313330331111112021111 |
5 | 204010121234021342423 |
6 | 2010242213000505141 |
7 | 61265135103211561 |
oct | 5667747525261125 |
9 | 1000836455060807 |
10 | 206155164246613 |
11 | 5a761a0684385a |
12 | 1b15630347b1b1 |
13 | 8b0546ba7634a |
14 | 38c9d6adbc6a1 |
15 | 18c78801a395d |
hex | bb7f3d556255 |
206155164246613 has 2 divisors, whose sum is σ = 206155164246614. Its totient is φ = 206155164246612.
The previous prime is 206155164246593. The next prime is 206155164246637. The reversal of 206155164246613 is 316642461551602.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128830172714244 + 77324991532369 = 11350338^2 + 8793463^2 .
It is a cyclic number.
It is not a de Polignac number, because 206155164246613 - 229 = 206154627375701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (206155164246313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 103077582123306 + 103077582123307.
It is an arithmetic number, because the mean of its divisors is an integer number (103077582123307).
Almost surely, 2206155164246613 is an apocalyptic number.
It is an amenable number.
206155164246613 is a deficient number, since it is larger than the sum of its proper divisors (1).
206155164246613 is an equidigital number, since it uses as much as digits as its factorization.
206155164246613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6220800, while the sum is 52.
The spelling of 206155164246613 in words is "two hundred six trillion, one hundred fifty-five billion, one hundred sixty-four million, two hundred forty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •