Base | Representation |
---|---|
bin | 11101110011110… |
… | …10011001010101 |
3 | 122102112111011011 |
4 | 32321322121111 |
5 | 1003003444141 |
6 | 40451412221 |
7 | 6124331650 |
oct | 1671723125 |
9 | 572474134 |
10 | 250062421 |
11 | 119176664 |
12 | 6b8b4071 |
13 | 3ca64c3b |
14 | 252d4897 |
15 | 16e47881 |
hex | ee7a655 |
250062421 has 8 divisors (see below), whose sum is σ = 286084224. Its totient is φ = 214115280.
The previous prime is 250062353. The next prime is 250062431. The reversal of 250062421 is 124260052.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 250062421 - 29 = 250061909 is a prime.
It is a super-3 number, since 3×2500624213 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 250062392 and 250062401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (250062431) 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, 11290 + ... + 25051.
It is an arithmetic number, because the mean of its divisors is an integer number (35760528).
Almost surely, 2250062421 is an apocalyptic number.
It is an amenable number.
250062421 is a deficient number, since it is larger than the sum of its proper divisors (36021803).
250062421 is an equidigital number, since it uses as much as digits as its factorization.
250062421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37331.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 250062421 is about 15813.3621029811. The cubic root of 250062421 is about 630.0129509389.
The spelling of 250062421 in words is "two hundred fifty million, sixty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •