Base | Representation |
---|---|
bin | 100101100111000… |
… | …1110011000111101 |
3 | 10020221201021012022 |
4 | 1023032032120331 |
5 | 10041034121112 |
6 | 325121245525 |
7 | 43162665026 |
oct | 11316163075 |
9 | 3227637168 |
10 | 1262020157 |
11 | 598417472 |
12 | 2b27938a5 |
13 | 1715caab8 |
14 | bd875c4d |
15 | 75bdbd72 |
hex | 4b38e63d |
1262020157 has 2 divisors, whose sum is σ = 1262020158. Its totient is φ = 1262020156.
The previous prime is 1262020127. The next prime is 1262020159. The reversal of 1262020157 is 7510202621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1242844516 + 19175641 = 35254^2 + 4379^2 .
It is a cyclic number.
It is not a de Polignac number, because 1262020157 - 28 = 1262019901 is a prime.
Together with 1262020159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1262020159) 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, 631010078 + 631010079.
It is an arithmetic number, because the mean of its divisors is an integer number (631010079).
Almost surely, 21262020157 is an apocalyptic number.
It is an amenable number.
1262020157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1262020157 is an equidigital number, since it uses as much as digits as its factorization.
1262020157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 1262020157 is about 35524.9230400292. The cubic root of 1262020157 is about 1080.6592217353.
Adding to 1262020157 its reverse (7510202621), we get a palindrome (8772222778).
The spelling of 1262020157 in words is "one billion, two hundred sixty-two million, twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •