Base | Representation |
---|---|
bin | 11000100110111… |
… | …10010001011101 |
3 | 112101102210112122 |
4 | 30103132101131 |
5 | 410321300300 |
6 | 32252312325 |
7 | 5054431412 |
oct | 1423362135 |
9 | 471383478 |
10 | 206431325 |
11 | a6585a01 |
12 | 591726a5 |
13 | 339c9719 |
14 | 1d5b8109 |
15 | 131c9c85 |
hex | c4de45d |
206431325 has 48 divisors (see below), whose sum is σ = 284077056. Its totient is φ = 148262400.
The previous prime is 206431321. The next prime is 206431327. The reversal of 206431325 is 523134602.
It is not a de Polignac number, because 206431325 - 22 = 206431321 is a prime.
It is a super-2 number, since 2×2064313252 = 85227783882511250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 206431294 and 206431303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206431321) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 659369 + ... + 659681.
It is an arithmetic number, because the mean of its divisors is an integer number (5918272).
Almost surely, 2206431325 is an apocalyptic number.
206431325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
206431325 is a deficient number, since it is larger than the sum of its proper divisors (77645731).
206431325 is a wasteful number, since it uses less digits than its factorization.
206431325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414 (or 409 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 206431325 is about 14367.7181556432. The cubic root of 206431325 is about 591.0059683911.
Adding to 206431325 its reverse (523134602), we get a palindrome (729565927).
The spelling of 206431325 in words is "two hundred six million, four hundred thirty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.308 sec. • engine limits •