Base | Representation |
---|---|
bin | 1100000010101000101… |
… | …1011111000011011101 |
3 | 201202221212000220011002 |
4 | 3000222023133003131 |
5 | 11342130204142221 |
6 | 235011042040045 |
7 | 20642222462540 |
oct | 3005213370335 |
9 | 652855026132 |
10 | 206866084061 |
11 | 7a80556983a |
12 | 34113049025 |
13 | 16679968100 |
14 | a025d3c857 |
15 | 55ab13980b |
hex | 302a2df0dd |
206866084061 has 24 divisors (see below), whose sum is σ = 256076614080. Its totient is φ = 163627416576.
The previous prime is 206866084037. The next prime is 206866084063. The reversal of 206866084061 is 160480668602.
It is a happy number.
206866084061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 206866084061 - 26 = 206866083997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 206866083997 and 206866084015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206866084063) 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 in 23 ways as a sum of consecutive naturals, for example, 4447421 + ... + 4493693.
It is an arithmetic number, because the mean of its divisors is an integer number (10669858920).
Almost surely, 2206866084061 is an apocalyptic number.
It is an amenable number.
206866084061 is a deficient number, since it is larger than the sum of its proper divisors (49210530019).
206866084061 is a wasteful number, since it uses less digits than its factorization.
206866084061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50085 (or 50072 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 47.
The spelling of 206866084061 in words is "two hundred six billion, eight hundred sixty-six million, eighty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •