Base | Representation |
---|---|
bin | 11000101011000… |
… | …10110100101001 |
3 | 112102110101021221 |
4 | 30111202310221 |
5 | 410441133444 |
6 | 32312102041 |
7 | 5062152316 |
oct | 1425426451 |
9 | 472411257 |
10 | 206974249 |
11 | a69168a9 |
12 | 59394921 |
13 | 33b59891 |
14 | 1d6b9d0d |
15 | 13285a84 |
hex | c562d29 |
206974249 has 4 divisors (see below), whose sum is σ = 207743940. Its totient is φ = 206204560.
The previous prime is 206974241. The next prime is 206974283. The reversal of 206974249 is 942479602.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6553600 + 200420649 = 2560^2 + 14157^2 .
It is a cyclic number.
It is not a de Polignac number, because 206974249 - 23 = 206974241 is a prime.
It is a super-2 number, since 2×2069742492 = 85676679498228002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (206974241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 384442 + ... + 384979.
It is an arithmetic number, because the mean of its divisors is an integer number (51935985).
Almost surely, 2206974249 is an apocalyptic number.
It is an amenable number.
206974249 is a deficient number, since it is larger than the sum of its proper divisors (769691).
206974249 is an equidigital number, since it uses as much as digits as its factorization.
206974249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769690.
The product of its (nonzero) digits is 217728, while the sum is 43.
The square root of 206974249 is about 14386.5996329918. The cubic root of 206974249 is about 591.5236392315.
The spelling of 206974249 in words is "two hundred six million, nine hundred seventy-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •