Base | Representation |
---|---|
bin | 10001111011011… |
… | …00010010111111 |
3 | 101110222121020012 |
4 | 20331230102333 |
5 | 301444434301 |
6 | 22531213435 |
7 | 3504202445 |
oct | 1075542277 |
9 | 343877205 |
10 | 150389951 |
11 | 77989218 |
12 | 4244727b |
13 | 2520754a |
14 | 15d8ab95 |
15 | d309ebb |
hex | 8f6c4bf |
150389951 has 2 divisors, whose sum is σ = 150389952. Its totient is φ = 150389950.
The previous prime is 150389947. The next prime is 150390029. The reversal of 150389951 is 159983051.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 150389951 - 22 = 150389947 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 150389899 and 150389908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150389651) 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, 75194975 + 75194976.
It is an arithmetic number, because the mean of its divisors is an integer number (75194976).
Almost surely, 2150389951 is an apocalyptic number.
150389951 is a deficient number, since it is larger than the sum of its proper divisors (1).
150389951 is an equidigital number, since it uses as much as digits as its factorization.
150389951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 41.
The square root of 150389951 is about 12263.3580637605. The cubic root of 150389951 is about 531.7893137036.
The spelling of 150389951 in words is "one hundred fifty million, three hundred eighty-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •