Base | Representation |
---|---|
bin | 11000100100110… |
… | …01011010011000 |
3 | 112100220110122020 |
4 | 30102121122120 |
5 | 410233234042 |
6 | 32242254440 |
7 | 5052145200 |
oct | 1422313230 |
9 | 470813566 |
10 | 206149272 |
11 | a6402aaa |
12 | 59057420 |
13 | 3392b224 |
14 | 1d543400 |
15 | 131713ec |
hex | c499698 |
206149272 has 96 divisors (see below), whose sum is σ = 602521920. Its totient is φ = 58605120.
The previous prime is 206149219. The next prime is 206149289. The reversal of 206149272 is 272941602.
206149272 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2061492722 = 84995044692259968, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 360747 + ... + 361317.
It is an arithmetic number, because the mean of its divisors is an integer number (6276270).
Almost surely, 2206149272 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 206149272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (301260960).
206149272 is an abundant number, since it is smaller than the sum of its proper divisors (396372648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206149272 is a wasteful number, since it uses less digits than its factorization.
206149272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 901 (or 890 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 206149272 is about 14357.8992892414. The cubic root of 206149272 is about 590.7366762764.
The spelling of 206149272 in words is "two hundred six million, one hundred forty-nine thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •