Base | Representation |
---|---|
bin | 111110101000110… |
… | …101000000010001 |
3 | 2201020102202102101 |
4 | 332220311000101 |
5 | 4123011442012 |
6 | 252140120401 |
7 | 35020263664 |
oct | 7650650021 |
9 | 2636382371 |
10 | 1050890257 |
11 | 49a22244a |
12 | 253b36101 |
13 | 139947871 |
14 | 9d7d76db |
15 | 623d4d57 |
hex | 3ea35011 |
1050890257 has 2 divisors, whose sum is σ = 1050890258. Its totient is φ = 1050890256.
The previous prime is 1050890231. The next prime is 1050890273. The reversal of 1050890257 is 7520980501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1001342736 + 49547521 = 31644^2 + 7039^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1050890257 is a prime.
It is a super-2 number, since 2×10508902572 = 2208740664515052098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1050890227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525445128 + 525445129.
It is an arithmetic number, because the mean of its divisors is an integer number (525445129).
Almost surely, 21050890257 is an apocalyptic number.
It is an amenable number.
1050890257 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050890257 is an equidigital number, since it uses as much as digits as its factorization.
1050890257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 37.
The square root of 1050890257 is about 32417.4375452472. The cubic root of 1050890257 is about 1016.6835308977.
The spelling of 1050890257 in words is "one billion, fifty million, eight hundred ninety thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •