Base | Representation |
---|---|
bin | 10001111100111… |
… | …00001100011101 |
3 | 101111100120100111 |
4 | 20332130030131 |
5 | 302022224031 |
6 | 22535330021 |
7 | 3505650436 |
oct | 1076341435 |
9 | 344316314 |
10 | 150586141 |
11 | 78002662 |
12 | 42520911 |
13 | 25275934 |
14 | 15ddc48d |
15 | d3481b1 |
hex | 8f9c31d |
150586141 has 2 divisors, whose sum is σ = 150586142. Its totient is φ = 150586140.
The previous prime is 150586097. The next prime is 150586147. The reversal of 150586141 is 141685051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91757241 + 58828900 = 9579^2 + 7670^2 .
It is an emirp because it is prime and its reverse (141685051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150586141 - 29 = 150585629 is a prime.
It is a super-2 number, since 2×1505861412 = 45352371722543762, which contains 22 as substring.
It is a Chen prime.
It is equal to p8475511 and since 150586141 and 8475511 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150586147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75293070 + 75293071.
It is an arithmetic number, because the mean of its divisors is an integer number (75293071).
Almost surely, 2150586141 is an apocalyptic number.
It is an amenable number.
150586141 is a deficient number, since it is larger than the sum of its proper divisors (1).
150586141 is an equidigital number, since it uses as much as digits as its factorization.
150586141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 31.
The square root of 150586141 is about 12271.3544892159. The cubic root of 150586141 is about 532.0204603754.
The spelling of 150586141 in words is "one hundred fifty million, five hundred eighty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •