Base | Representation |
---|---|
bin | 111110101001100… |
… | …001011010011101 |
3 | 2201020202222221102 |
4 | 332221201122131 |
5 | 4123033302112 |
6 | 252144042445 |
7 | 35021652212 |
oct | 7651413235 |
9 | 2636688842 |
10 | 1051072157 |
11 | 49a337083 |
12 | 254003425 |
13 | 1399ac5b5 |
14 | 9d843b09 |
15 | 6241dbc2 |
hex | 3ea6169d |
1051072157 has 2 divisors, whose sum is σ = 1051072158. Its totient is φ = 1051072156.
The previous prime is 1051072129. The next prime is 1051072171. The reversal of 1051072157 is 7512701501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 750431236 + 300640921 = 27394^2 + 17339^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051072157 - 224 = 1034294941 is a prime.
It is a super-2 number, since 2×10510721572 = 2209505358441265298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1051072117) 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, 525536078 + 525536079.
It is an arithmetic number, because the mean of its divisors is an integer number (525536079).
Almost surely, 21051072157 is an apocalyptic number.
It is an amenable number.
1051072157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051072157 is an equidigital number, since it uses as much as digits as its factorization.
1051072157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2450, while the sum is 29.
The square root of 1051072157 is about 32420.2430126611. The cubic root of 1051072157 is about 1016.7421872175.
Adding to 1051072157 its reverse (7512701501), we get a palindrome (8563773658).
The spelling of 1051072157 in words is "one billion, fifty-one million, seventy-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •