Base | Representation |
---|---|
bin | 10010011110111… |
… | …01010100000001 |
3 | 101210202012201202 |
4 | 21033131110001 |
5 | 304143002134 |
6 | 23215110545 |
7 | 3561610364 |
oct | 1117352401 |
9 | 353665652 |
10 | 155047169 |
11 | 7a57a262 |
12 | 43b12455 |
13 | 261782b4 |
14 | 168400db |
15 | d929d7e |
hex | 93dd501 |
155047169 has 2 divisors, whose sum is σ = 155047170. Its totient is φ = 155047168.
The previous prime is 155047141. The next prime is 155047171. The reversal of 155047169 is 961740551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153388225 + 1658944 = 12385^2 + 1288^2 .
It is a cyclic number.
It is not a de Polignac number, because 155047169 - 216 = 154981633 is a prime.
It is a super-2 number, since 2×1550471692 = 48079249229829122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 155047171, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (155007169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77523584 + 77523585.
It is an arithmetic number, because the mean of its divisors is an integer number (77523585).
Almost surely, 2155047169 is an apocalyptic number.
It is an amenable number.
155047169 is a deficient number, since it is larger than the sum of its proper divisors (1).
155047169 is an equidigital number, since it uses as much as digits as its factorization.
155047169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 38.
The square root of 155047169 is about 12451.7938065164. The cubic root of 155047169 is about 537.2230196512.
The spelling of 155047169 in words is "one hundred fifty-five million, forty-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •