Base | Representation |
---|---|
bin | 10001111101011… |
… | …10100010001101 |
3 | 101111111101101201 |
4 | 20332232202031 |
5 | 302032130021 |
6 | 22541105501 |
7 | 3506412442 |
oct | 1076564215 |
9 | 344441351 |
10 | 150661261 |
11 | 78054043 |
12 | 42558291 |
13 | 252a0b9a |
14 | 1601b9c9 |
15 | d360591 |
hex | 8fae88d |
150661261 has 2 divisors, whose sum is σ = 150661262. Its totient is φ = 150661260.
The previous prime is 150661249. The next prime is 150661267. The reversal of 150661261 is 162166051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148718025 + 1943236 = 12195^2 + 1394^2 .
It is an emirp because it is prime and its reverse (162166051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150661261 - 211 = 150659213 is a prime.
It is a super-2 number, since 2×1506612612 = 45397631132220242, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150661267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75330630 + 75330631.
It is an arithmetic number, because the mean of its divisors is an integer number (75330631).
Almost surely, 2150661261 is an apocalyptic number.
It is an amenable number.
150661261 is a deficient number, since it is larger than the sum of its proper divisors (1).
150661261 is an equidigital number, since it uses as much as digits as its factorization.
150661261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 150661261 is about 12274.4148944054. The cubic root of 150661261 is about 532.1089119265.
The spelling of 150661261 in words is "one hundred fifty million, six hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •