Base | Representation |
---|---|
bin | 10010101011110… |
… | …11110100110101 |
3 | 101220221110201212 |
4 | 21111323310311 |
5 | 310111320023 |
6 | 23315331205 |
7 | 3612211355 |
oct | 1125736465 |
9 | 356843655 |
10 | 156745013 |
11 | 80529937 |
12 | 445b0b05 |
13 | 26621039 |
14 | 16b62b65 |
15 | db62e78 |
hex | 957bd35 |
156745013 has 2 divisors, whose sum is σ = 156745014. Its totient is φ = 156745012.
The previous prime is 156744989. The next prime is 156745033. The reversal of 156745013 is 310547651.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106646929 + 50098084 = 10327^2 + 7078^2 .
It is an emirp because it is prime and its reverse (310547651) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 156745013 - 26 = 156744949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (156745033) 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, 78372506 + 78372507.
It is an arithmetic number, because the mean of its divisors is an integer number (78372507).
Almost surely, 2156745013 is an apocalyptic number.
It is an amenable number.
156745013 is a deficient number, since it is larger than the sum of its proper divisors (1).
156745013 is an equidigital number, since it uses as much as digits as its factorization.
156745013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 156745013 is about 12519.7848623688. The cubic root of 156745013 is about 539.1768586050.
The spelling of 156745013 in words is "one hundred fifty-six million, seven hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •