Base | Representation |
---|---|
bin | 10001111001011… |
… | …11110100010111 |
3 | 101110112000102101 |
4 | 20330233310113 |
5 | 301414022411 |
6 | 22522022531 |
7 | 3502121311 |
oct | 1074576427 |
9 | 343460371 |
10 | 150142231 |
11 | 7782a098 |
12 | 42347a47 |
13 | 2514b875 |
14 | 15d247b1 |
15 | d2ab8c1 |
hex | 8f2fd17 |
150142231 has 2 divisors, whose sum is σ = 150142232. Its totient is φ = 150142230.
The previous prime is 150142177. The next prime is 150142253. The reversal of 150142231 is 132241051.
It is a strong prime.
It is an emirp because it is prime and its reverse (132241051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150142231 - 211 = 150140183 is a prime.
It is a super-2 number, since 2×1501422312 = 45085379059314722, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 150142199 and 150142208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150142261) 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, 75071115 + 75071116.
It is an arithmetic number, because the mean of its divisors is an integer number (75071116).
Almost surely, 2150142231 is an apocalyptic number.
150142231 is a deficient number, since it is larger than the sum of its proper divisors (1).
150142231 is an equidigital number, since it uses as much as digits as its factorization.
150142231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 150142231 is about 12253.2538943743. The cubic root of 150142231 is about 531.4971681963.
Adding to 150142231 its reverse (132241051), we get a palindrome (282383282).
The spelling of 150142231 in words is "one hundred fifty million, one hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •