Base | Representation |
---|---|
bin | 11101111010001… |
… | …00100011110001 |
3 | 122111002120001001 |
4 | 32331010203301 |
5 | 1003211443411 |
6 | 40521242001 |
7 | 6134351062 |
oct | 1675044361 |
9 | 574076031 |
10 | 250890481 |
11 | 119691806 |
12 | 70033301 |
13 | 3cc94b0a |
14 | 2546c569 |
15 | 1705cdc1 |
hex | ef448f1 |
250890481 has 4 divisors (see below), whose sum is σ = 250926052. Its totient is φ = 250854912.
The previous prime is 250890467. The next prime is 250890511. The reversal of 250890481 is 184098052.
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 71571600 + 179318881 = 8460^2 + 13391^2 .
It is a cyclic number.
It is not a de Polignac number, because 250890481 - 25 = 250890449 is a prime.
It is a super-2 number, since 2×2508904812 = 125892066912822722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 250890481.
It is not an unprimeable number, because it can be changed into a prime (250890401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3240 + ... + 22633.
It is an arithmetic number, because the mean of its divisors is an integer number (62731513).
Almost surely, 2250890481 is an apocalyptic number.
It is an amenable number.
250890481 is a deficient number, since it is larger than the sum of its proper divisors (35571).
250890481 is an equidigital number, since it uses as much as digits as its factorization.
250890481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35570.
The product of its (nonzero) digits is 23040, while the sum is 37.
The square root of 250890481 is about 15839.5227516488. The cubic root of 250890481 is about 630.7075958160.
The spelling of 250890481 in words is "two hundred fifty million, eight hundred ninety thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •