Base | Representation |
---|---|
bin | 11001000010111… |
… | …101011011110101 |
3 | 1002021200200201020 |
4 | 121002331123311 |
5 | 1330033100300 |
6 | 105410251353 |
7 | 13261460220 |
oct | 3102753365 |
9 | 1067620636 |
10 | 420206325 |
11 | 1a6217260 |
12 | b8886b59 |
13 | 690978c6 |
14 | 3db445b7 |
15 | 26d558a0 |
hex | 190bd6f5 |
420206325 has 48 divisors (see below), whose sum is σ = 866182656. Its totient is φ = 174628800.
The previous prime is 420206257. The next prime is 420206327. The reversal of 420206325 is 523602024.
It is not a de Polignac number, because 420206325 - 211 = 420204277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 420206295 and 420206304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420206327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 30607 + ... + 42156.
It is an arithmetic number, because the mean of its divisors is an integer number (18045472).
Almost surely, 2420206325 is an apocalyptic number.
It is an amenable number.
420206325 is an abundant number, since it is smaller than the sum of its proper divisors (445976331).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420206325 is a wasteful number, since it uses less digits than its factorization.
420206325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72794 (or 72789 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 420206325 is about 20498.9347284194. The cubic root of 420206325 is about 749.0098489320.
Adding to 420206325 its reverse (523602024), we get a palindrome (943808349).
The spelling of 420206325 in words is "four hundred twenty million, two hundred six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •