Base | Representation |
---|---|
bin | 11101110101110… |
… | …10100110100101 |
3 | 122110000211220121 |
4 | 32322322212211 |
5 | 1003040403123 |
6 | 40501201541 |
7 | 6126505462 |
oct | 1672724645 |
9 | 573024817 |
10 | 250325413 |
11 | 119336208 |
12 | 6ba002b1 |
13 | 3cb27860 |
14 | 25362669 |
15 | 16e9a75d |
hex | eeba9a5 |
250325413 has 8 divisors (see below), whose sum is σ = 274668408. Its totient is φ = 226709184.
The previous prime is 250325407. The next prime is 250325417. The reversal of 250325413 is 314523052.
It can be written as a sum of positive squares in 4 ways, for example, as 86434209 + 163891204 = 9297^2 + 12802^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 250325413 - 25 = 250325381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250325417) 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 7 ways as a sum of consecutive naturals, for example, 180970 + ... + 182347.
It is an arithmetic number, because the mean of its divisors is an integer number (34333551).
Almost surely, 2250325413 is an apocalyptic number.
It is an amenable number.
250325413 is a deficient number, since it is larger than the sum of its proper divisors (24342995).
250325413 is a wasteful number, since it uses less digits than its factorization.
250325413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363383.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 250325413 is about 15821.6754169715. The cubic root of 250325413 is about 630.2337362321.
Adding to 250325413 its reverse (314523052), we get a palindrome (564848465).
The spelling of 250325413 in words is "two hundred fifty million, three hundred twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •