Base | Representation |
---|---|
bin | 101101101010000… |
… | …1001111010101101 |
3 | 10221202202011211221 |
4 | 1123110021322231 |
5 | 11114143311112 |
6 | 412004143341 |
7 | 52651604626 |
oct | 13324117255 |
9 | 3852664757 |
10 | 1532010157 |
11 | 7168639a7 |
12 | 369097b51 |
13 | 1b551c1b2 |
14 | 107676a4d |
15 | 8e76de07 |
hex | 5b509ead |
1532010157 has 2 divisors, whose sum is σ = 1532010158. Its totient is φ = 1532010156.
The previous prime is 1532010121. The next prime is 1532010169. The reversal of 1532010157 is 7510102351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 851530761 + 680479396 = 29181^2 + 26086^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1532010157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1532019157) 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, 766005078 + 766005079.
It is an arithmetic number, because the mean of its divisors is an integer number (766005079).
Almost surely, 21532010157 is an apocalyptic number.
It is an amenable number.
1532010157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1532010157 is an equidigital number, since it uses as much as digits as its factorization.
1532010157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 1532010157 is about 39140.9013309607. The cubic root of 1532010157 is about 1152.7997710088.
The spelling of 1532010157 in words is "one billion, five hundred thirty-two million, ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •