Base | Representation |
---|---|
bin | 1100000001010110110… |
… | …0111011111000111000 |
3 | 201202001220120121110212 |
4 | 3000111230323320320 |
5 | 11340424232001014 |
6 | 234513010330252 |
7 | 20630551360331 |
oct | 3002554737070 |
9 | 652056517425 |
10 | 206522531384 |
11 | 7a649648604 |
12 | 34037b89988 |
13 | 1662372b6c0 |
14 | 9dd246d288 |
15 | 558adc623e |
hex | 3015b3be38 |
206522531384 has 32 divisors (see below), whose sum is σ = 417117792000. Its totient is φ = 95294973312.
The previous prime is 206522531377. The next prime is 206522531387. The reversal of 206522531384 is 483135225602.
206522531384 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206522531387) 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 7 ways as a sum of consecutive naturals, for example, 193802 + ... + 671270.
It is an arithmetic number, because the mean of its divisors is an integer number (13034931000).
Almost surely, 2206522531384 is an apocalyptic number.
It is an amenable number.
206522531384 is an abundant number, since it is smaller than the sum of its proper divisors (210595260616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206522531384 is a wasteful number, since it uses less digits than its factorization.
206522531384 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481647 (or 481643 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
Adding to 206522531384 its reverse (483135225602), we get a palindrome (689657756986).
The spelling of 206522531384 in words is "two hundred six billion, five hundred twenty-two million, five hundred thirty-one thousand, three hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •