Base | Representation |
---|---|
bin | 1100000001101111111… |
… | …1100011001100100100 |
3 | 201202100021011202002212 |
4 | 3000123333203030210 |
5 | 11341133241334101 |
6 | 234531300422552 |
7 | 20633302436501 |
oct | 3003377431444 |
9 | 652307152085 |
10 | 206628074276 |
11 | 7a6a3185538 |
12 | 340673a7a58 |
13 | 1663c563110 |
14 | a0024a44a8 |
15 | 55952c31bb |
hex | 301bfe3324 |
206628074276 has 96 divisors (see below), whose sum is σ = 426323520000. Its totient is φ = 86791730688.
The previous prime is 206628074249. The next prime is 206628074287. The reversal of 206628074276 is 672470826602.
206628074276 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2066280742762 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2852150 + ... + 2923698.
It is an arithmetic number, because the mean of its divisors is an integer number (4440870000).
Almost surely, 2206628074276 is an apocalyptic number.
206628074276 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
206628074276 is an abundant number, since it is smaller than the sum of its proper divisors (219695445724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206628074276 is a wasteful number, since it uses less digits than its factorization.
206628074276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71701 (or 71699 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 50.
The spelling of 206628074276 in words is "two hundred six billion, six hundred twenty-eight million, seventy-four thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •