Base | Representation |
---|---|
bin | 10001111100100… |
… | …11011001101001 |
3 | 101111021201221102 |
4 | 20332103121221 |
5 | 302020100441 |
6 | 22534451145 |
7 | 3505440431 |
oct | 1076233151 |
9 | 344251842 |
10 | 150550121 |
11 | 77a88597 |
12 | 42503ab5 |
13 | 25262417 |
14 | 15dcd2c1 |
15 | d33c69b |
hex | 8f93669 |
150550121 has 2 divisors, whose sum is σ = 150550122. Its totient is φ = 150550120.
The previous prime is 150550109. The next prime is 150550133. The reversal of 150550121 is 121055051.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (150550109) and next prime (150550133).
It can be written as a sum of positive squares in only one way, i.e., 125440000 + 25110121 = 11200^2 + 5011^2 .
It is a cyclic number.
It is not a de Polignac number, because 150550121 - 226 = 83441257 is a prime.
It is a super-2 number, since 2×1505501212 = 45330677866229282, 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 = 150550093 and 150550102.
It is not a weakly prime, because it can be changed into another prime (150550721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75275060 + 75275061.
It is an arithmetic number, because the mean of its divisors is an integer number (75275061).
Almost surely, 2150550121 is an apocalyptic number.
It is an amenable number.
150550121 is a deficient number, since it is larger than the sum of its proper divisors (1).
150550121 is an equidigital number, since it uses as much as digits as its factorization.
150550121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 250, while the sum is 20.
The square root of 150550121 is about 12269.8867557936. The cubic root of 150550121 is about 531.9780374693.
The spelling of 150550121 in words is "one hundred fifty million, five hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •