Base | Representation |
---|---|
bin | 11000100000010… |
… | …01011000000000 |
3 | 112022210111100021 |
4 | 30100021120000 |
5 | 410110344141 |
6 | 32221503224 |
7 | 5044140145 |
oct | 1420113000 |
9 | 468714307 |
10 | 205559296 |
11 | a603a818 |
12 | 58a11b14 |
13 | 33782827 |
14 | 1d42c3cc |
15 | 130a66d1 |
hex | c409600 |
205559296 has 40 divisors (see below), whose sum is σ = 415051560. Its totient is φ = 101695488.
The previous prime is 205559293. The next prime is 205559297. The reversal of 205559296 is 692955502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205559293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47595 + ... + 51733.
It is an arithmetic number, because the mean of its divisors is an integer number (10376289).
Almost surely, 2205559296 is an apocalyptic number.
205559296 is the 8278-th octagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 205559296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207525780).
205559296 is an abundant number, since it is smaller than the sum of its proper divisors (209492264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205559296 is an frugal number, since it uses more digits than its factorization.
205559296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4254 (or 4238 counting only the distinct ones).
The product of its (nonzero) digits is 243000, while the sum is 43.
The square root of 205559296 is about 14337.3392231613. The cubic root of 205559296 is about 590.1725972105.
The spelling of 205559296 in words is "two hundred five million, five hundred fifty-nine thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •