Base | Representation |
---|---|
bin | 10010101010010… |
… | …00010110000101 |
3 | 101220112202111002 |
4 | 21111020112011 |
5 | 310033043044 |
6 | 23311023045 |
7 | 3610342532 |
oct | 1125102605 |
9 | 356482432 |
10 | 156534149 |
11 | 803a5472 |
12 | 4450aa85 |
13 | 26579075 |
14 | 16b09d89 |
15 | db2074e |
hex | 9548585 |
156534149 has 2 divisors, whose sum is σ = 156534150. Its totient is φ = 156534148.
The previous prime is 156534107. The next prime is 156534151. The reversal of 156534149 is 941435651.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150234049 + 6300100 = 12257^2 + 2510^2 .
It is a cyclic number.
It is not a de Polignac number, because 156534149 - 212 = 156530053 is a prime.
It is a Sophie Germain prime.
Together with 156534151, it forms a pair of twin primes.
It is a Chen 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 (156534449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78267074 + 78267075.
It is an arithmetic number, because the mean of its divisors is an integer number (78267075).
Almost surely, 2156534149 is an apocalyptic number.
It is an amenable number.
156534149 is a deficient number, since it is larger than the sum of its proper divisors (1).
156534149 is an equidigital number, since it uses as much as digits as its factorization.
156534149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 64800, while the sum is 38.
The square root of 156534149 is about 12511.3607972914. The cubic root of 156534149 is about 538.9349710375.
The spelling of 156534149 in words is "one hundred fifty-six million, five hundred thirty-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •