Base | Representation |
---|---|
bin | 11000100110111… |
… | …00110010010011 |
3 | 112101102111012002 |
4 | 30103130302103 |
5 | 410321101420 |
6 | 32252224215 |
7 | 5054404562 |
oct | 1423346223 |
9 | 471374162 |
10 | 206425235 |
11 | a6581375 |
12 | 5916b06b |
13 | 339c6a13 |
14 | 1d5b5bd9 |
15 | 131c8075 |
hex | c4dcc93 |
206425235 has 8 divisors (see below), whose sum is σ = 247926096. Its totient is φ = 164996320.
The previous prime is 206425229. The next prime is 206425259. The reversal of 206425235 is 532524602.
206425235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 206425235 - 212 = 206421139 is a prime.
It is a super-2 number, since 2×2064252352 = 85222755289610450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 206425198 and 206425207.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11456 + ... + 23325.
It is an arithmetic number, because the mean of its divisors is an integer number (30990762).
Almost surely, 2206425235 is an apocalyptic number.
206425235 is a deficient number, since it is larger than the sum of its proper divisors (41500861).
206425235 is a wasteful number, since it uses less digits than its factorization.
206425235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35973.
The product of its (nonzero) digits is 14400, while the sum is 29.
The square root of 206425235 is about 14367.5062206355. The cubic root of 206425235 is about 591.0001565120. Note that the first 3 decimals are identical.
Adding to 206425235 its reverse (532524602), we get a palindrome (738949837).
The spelling of 206425235 in words is "two hundred six million, four hundred twenty-five thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •