Base | Representation |
---|---|
bin | 10111110110010… |
… | …00011011111001 |
3 | 111221102121121000 |
4 | 23323020123321 |
5 | 402203103200 |
6 | 31503435213 |
7 | 4646254251 |
oct | 1373103371 |
9 | 457377530 |
10 | 200050425 |
11 | a2a17933 |
12 | 56bb5b09 |
13 | 325a4243 |
14 | 1c7d6961 |
15 | 12869300 |
hex | bec86f9 |
200050425 has 48 divisors (see below), whose sum is σ = 371008000. Its totient is φ = 105675840.
The previous prime is 200050423. The next prime is 200050427. The reversal of 200050425 is 524050002.
It is an interprime number because it is at equal distance from previous prime (200050423) and next prime (200050427).
It is not a de Polignac number, because 200050425 - 21 = 200050423 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200050398 and 200050407.
It is not an unprimeable number, because it can be changed into a prime (200050423) 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, 72216 + ... + 74934.
Almost surely, 2200050425 is an apocalyptic number.
200050425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
200050425 is a deficient number, since it is larger than the sum of its proper divisors (170957575).
200050425 is a wasteful number, since it uses less digits than its factorization.
200050425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2847 (or 2836 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 18.
The square root of 200050425 is about 14143.9183043455. The cubic root of 200050425 is about 584.8526913775.
It can be divided in two parts, 2000 and 50425, that added together give a palindrome (52425).
The spelling of 200050425 in words is "two hundred million, fifty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •