Base | Representation |
---|---|
bin | 101110111000101110010110… |
… | …000011100011111011101111 |
3 | 1000001010022101110211112000222 |
4 | 232320232112003203323233 |
5 | 204012003334221124041 |
6 | 2010322422533241555 |
7 | 61302023144605646 |
oct | 5670562603437357 |
9 | 1001108343745028 |
10 | 206208192364271 |
11 | 5a782448831489 |
12 | 1b1646424932bb |
13 | 8b0a46cc93866 |
14 | 38cc75b95435d |
15 | 18c8e357e374b |
hex | bb8b960e3eef |
206208192364271 has 16 divisors (see below), whose sum is σ = 216469818163200. Its totient is φ = 196172236821600.
The previous prime is 206208192364253. The next prime is 206208192364297. The reversal of 206208192364271 is 172463291802602.
It is a cyclic number.
It is not a de Polignac number, because 206208192364271 - 218 = 206208192102127 is a prime.
It is a super-2 number, since 2×2062081923642712 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206208192361271) 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 in 15 ways as a sum of consecutive naturals, for example, 231437810 + ... + 232327088.
It is an arithmetic number, because the mean of its divisors is an integer number (13529363635200).
Almost surely, 2206208192364271 is an apocalyptic number.
206208192364271 is a deficient number, since it is larger than the sum of its proper divisors (10261625798929).
206208192364271 is a wasteful number, since it uses less digits than its factorization.
206208192364271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016150.
The product of its (nonzero) digits is 3483648, while the sum is 53.
The spelling of 206208192364271 in words is "two hundred six trillion, two hundred eight billion, one hundred ninety-two million, three hundred sixty-four thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •