Base | Representation |
---|---|
bin | 11001010111101… |
… | …001101000000001 |
3 | 1002122220020212211 |
4 | 121113221220001 |
5 | 1332430131314 |
6 | 110122422121 |
7 | 13355540254 |
oct | 3127515001 |
9 | 1078806784 |
10 | 425630209 |
11 | 1a9291304 |
12 | ba661941 |
13 | 6a2465c4 |
14 | 4075709b |
15 | 275779c4 |
hex | 195e9a01 |
425630209 has 4 divisors (see below), whose sum is σ = 426149460. Its totient is φ = 425110960.
The previous prime is 425630201. The next prime is 425630263. The reversal of 425630209 is 902036524.
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 90630400 + 334999809 = 9520^2 + 18303^2 .
It is a cyclic number.
It is not a de Polignac number, because 425630209 - 23 = 425630201 is a prime.
It is a super-2 number, since 2×4256302092 = 362322149626767362, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (425630201) 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, 258394 + ... + 260035.
It is an arithmetic number, because the mean of its divisors is an integer number (106537365).
Almost surely, 2425630209 is an apocalyptic number.
It is an amenable number.
425630209 is a deficient number, since it is larger than the sum of its proper divisors (519251).
425630209 is an equidigital number, since it uses as much as digits as its factorization.
425630209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519250.
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 425630209 is about 20630.8072794062. The cubic root of 425630209 is about 752.2187388285.
The spelling of 425630209 in words is "four hundred twenty-five million, six hundred thirty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •