Base | Representation |
---|---|
bin | 10001111001100… |
… | …01100010001101 |
3 | 101110112101001202 |
4 | 20330301202031 |
5 | 301414234021 |
6 | 22522115245 |
7 | 3502150643 |
oct | 1074614215 |
9 | 343471052 |
10 | 150149261 |
11 | 778343a9 |
12 | 4234bb25 |
13 | 25151b22 |
14 | 15d27193 |
15 | d2ada0b |
hex | 8f3188d |
150149261 has 2 divisors, whose sum is σ = 150149262. Its totient is φ = 150149260.
The previous prime is 150149231. The next prime is 150149297. The reversal of 150149261 is 162941051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143544361 + 6604900 = 11981^2 + 2570^2 .
It is a cyclic number.
It is not a de Polignac number, because 150149261 - 210 = 150148237 is a prime.
It is a super-2 number, since 2×1501492612 = 45089601157692242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150149201) 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, 75074630 + 75074631.
It is an arithmetic number, because the mean of its divisors is an integer number (75074631).
Almost surely, 2150149261 is an apocalyptic number.
It is an amenable number.
150149261 is a deficient number, since it is larger than the sum of its proper divisors (1).
150149261 is an equidigital number, since it uses as much as digits as its factorization.
150149261 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 29.
The square root of 150149261 is about 12253.5407535944. The cubic root of 150149261 is about 531.5054633681.
The spelling of 150149261 in words is "one hundred fifty million, one hundred forty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •