Base | Representation |
---|---|
bin | 11101111011001… |
… | …00111011001001 |
3 | 122111100021212222 |
4 | 32331210323021 |
5 | 1003230214144 |
6 | 40524143425 |
7 | 6135442424 |
oct | 1675447311 |
9 | 574307788 |
10 | 251023049 |
11 | 119772372 |
12 | 70097b75 |
13 | 40010264 |
14 | 254a49bb |
15 | 170872ee |
hex | ef64ec9 |
251023049 has 2 divisors, whose sum is σ = 251023050. Its totient is φ = 251023048.
The previous prime is 251023039. The next prime is 251023057. The reversal of 251023049 is 940320152.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 238548025 + 12475024 = 15445^2 + 3532^2 .
It is a cyclic number.
It is not a de Polignac number, because 251023049 - 212 = 251018953 is a prime.
It is a super-2 number, since 2×2510230492 = 126025142258512802, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p13732253 and since 251023049 and 13732253 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (251023009) 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 as a sum of consecutive naturals, namely, 125511524 + 125511525.
It is an arithmetic number, because the mean of its divisors is an integer number (125511525).
Almost surely, 2251023049 is an apocalyptic number.
It is an amenable number.
251023049 is a deficient number, since it is larger than the sum of its proper divisors (1).
251023049 is an equidigital number, since it uses as much as digits as its factorization.
251023049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 251023049 is about 15843.7069210460. The cubic root of 251023049 is about 630.8186627671.
The spelling of 251023049 in words is "two hundred fifty-one million, twenty-three thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •