Base | Representation |
---|---|
bin | 11000100110110… |
… | …01010101000000 |
3 | 112101101202202112 |
4 | 30103121111000 |
5 | 410320123242 |
6 | 32252034452 |
7 | 5054315360 |
oct | 1423312500 |
9 | 471352675 |
10 | 206411072 |
11 | a657176a |
12 | 59162a28 |
13 | 339c043a |
14 | 1d5b09a0 |
15 | 131c3c82 |
hex | c4d9540 |
206411072 has 56 divisors (see below), whose sum is σ = 469635840. Its totient is φ = 88174080.
The previous prime is 206411071. The next prime is 206411089. The reversal of 206411072 is 270114602.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206411071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192554 + ... + 193622.
Almost surely, 2206411072 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 206411072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234817920).
206411072 is an abundant number, since it is smaller than the sum of its proper divisors (263224768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206411072 is a wasteful number, since it uses less digits than its factorization.
206411072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519 (or 1509 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 206411072 is about 14367.0133291509. The cubic root of 206411072 is about 590.9866398721.
Adding to 206411072 its reverse (270114602), we get a palindrome (476525674).
The spelling of 206411072 in words is "two hundred six million, four hundred eleven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •