Base | Representation |
---|---|
bin | 111111010000101… |
… | …111001011011101 |
3 | 2201222010021110011 |
4 | 333100233023131 |
5 | 4133201232112 |
6 | 253152243221 |
7 | 35205226105 |
oct | 7720571335 |
9 | 2658107404 |
10 | 1061352157 |
11 | 4a5118648 |
12 | 257540511 |
13 | 13bb6b738 |
14 | a0d5c205 |
15 | 6329eaa7 |
hex | 3f42f2dd |
1061352157 has 2 divisors, whose sum is σ = 1061352158. Its totient is φ = 1061352156.
The previous prime is 1061352151. The next prime is 1061352209. The reversal of 1061352157 is 7512531601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 574752676 + 486599481 = 23974^2 + 22059^2 .
It is a cyclic number.
It is not a de Polignac number, because 1061352157 - 211 = 1061350109 is a prime.
It is a super-2 number, since 2×10613521572 = 2252936802337105298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1061352151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530676078 + 530676079.
It is an arithmetic number, because the mean of its divisors is an integer number (530676079).
Almost surely, 21061352157 is an apocalyptic number.
It is an amenable number.
1061352157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061352157 is an equidigital number, since it uses as much as digits as its factorization.
1061352157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6300, while the sum is 31.
The square root of 1061352157 is about 32578.4001602289. The cubic root of 1061352157 is about 1020.0461843115.
Adding to 1061352157 its reverse (7512531601), we get a palindrome (8573883758).
The spelling of 1061352157 in words is "one billion, sixty-one million, three hundred fifty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •