Base | Representation |
---|---|
bin | 1011111111000101001… |
… | …0000010110010010000 |
3 | 201200111022211002200202 |
4 | 2333301102002302100 |
5 | 11333201321030333 |
6 | 234332222034332 |
7 | 20606451613424 |
oct | 2776122026220 |
9 | 650438732622 |
10 | 205911501968 |
11 | 7a365747117 |
12 | 33aa74189a8 |
13 | 16556c70833 |
14 | 9d75254b84 |
15 | 555242a5e8 |
hex | 2ff1482c90 |
205911501968 has 80 divisors (see below), whose sum is σ = 426071688000. Its totient is φ = 96125792256.
The previous prime is 205911501941. The next prime is 205911502001. The reversal of 205911501968 is 869105119502.
It is a happy number.
It is a super-3 number, since 3×2059115019683 (a number of 35 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5771288 + ... + 5806856.
It is an arithmetic number, because the mean of its divisors is an integer number (5325896100).
Almost surely, 2205911501968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 205911501968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213035844000).
205911501968 is an abundant number, since it is smaller than the sum of its proper divisors (220160186032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205911501968 is a wasteful number, since it uses less digits than its factorization.
205911501968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35872 (or 35866 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 47.
The spelling of 205911501968 in words is "two hundred five billion, nine hundred eleven million, five hundred one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •