Base | Representation |
---|---|
bin | 111110010010110… |
… | …100010010011101 |
3 | 2200211120121022222 |
4 | 332102310102131 |
5 | 4120022321112 |
6 | 251412315125 |
7 | 34620242354 |
oct | 7622642235 |
9 | 2624517288 |
10 | 1045120157 |
11 | 496a41274 |
12 | 252012aa5 |
13 | 1386a73c3 |
14 | 9cb3499b |
15 | 61b45372 |
hex | 3e4b449d |
1045120157 has 2 divisors, whose sum is σ = 1045120158. Its totient is φ = 1045120156.
The previous prime is 1045120127. The next prime is 1045120187. The reversal of 1045120157 is 7510215401.
It is a balanced prime because it is at equal distance from previous prime (1045120127) and next prime (1045120187).
It can be written as a sum of positive squares in only one way, i.e., 882149401 + 162970756 = 29701^2 + 12766^2 .
It is a cyclic number.
It is not a de Polignac number, because 1045120157 - 210 = 1045119133 is a prime.
It is a super-2 number, since 2×10451201572 = 2184552285135409298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1045120127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522560078 + 522560079.
It is an arithmetic number, because the mean of its divisors is an integer number (522560079).
Almost surely, 21045120157 is an apocalyptic number.
It is an amenable number.
1045120157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1045120157 is an equidigital number, since it uses as much as digits as its factorization.
1045120157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1400, while the sum is 26.
The square root of 1045120157 is about 32328.3181900946. The cubic root of 1045120157 is about 1014.8193542313.
Adding to 1045120157 its reverse (7510215401), we get a palindrome (8555335558).
The spelling of 1045120157 in words is "one billion, forty-five million, one hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •