Base | Representation |
---|---|
bin | 10001111111010… |
… | …01110101010011 |
3 | 101111221201120111 |
4 | 20333221311103 |
5 | 302112413042 |
6 | 22550222151 |
7 | 3511443532 |
oct | 1077516523 |
9 | 344851514 |
10 | 150904147 |
11 | 781aa579 |
12 | 42654957 |
13 | 253575c4 |
14 | 16082319 |
15 | d3ac517 |
hex | 8fe9d53 |
150904147 has 2 divisors, whose sum is σ = 150904148. Its totient is φ = 150904146.
The previous prime is 150904129. The next prime is 150904151. The reversal of 150904147 is 741409051.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150904147 - 227 = 16686419 is a prime.
It is not a weakly prime, because it can be changed into another prime (150904177) 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, 75452073 + 75452074.
It is an arithmetic number, because the mean of its divisors is an integer number (75452074).
Almost surely, 2150904147 is an apocalyptic number.
150904147 is a deficient number, since it is larger than the sum of its proper divisors (1).
150904147 is an equidigital number, since it uses as much as digits as its factorization.
150904147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 150904147 is about 12284.3049050404. The cubic root of 150904147 is about 532.3947018608.
The spelling of 150904147 in words is "one hundred fifty million, nine hundred four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •