Base | Representation |
---|---|
bin | 10001111000011… |
… | …11100100111001 |
3 | 101110021022021012 |
4 | 20330033210321 |
5 | 301400311134 |
6 | 22515123305 |
7 | 3501031301 |
oct | 1074174471 |
9 | 343238235 |
10 | 150010169 |
11 | 77749951 |
12 | 422a3535 |
13 | 2510371a |
14 | 15ccc601 |
15 | d2826ce |
hex | 8f0f939 |
150010169 has 2 divisors, whose sum is σ = 150010170. Its totient is φ = 150010168.
The previous prime is 150010151. The next prime is 150010171. The reversal of 150010169 is 961010051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90535225 + 59474944 = 9515^2 + 7712^2 .
It is a cyclic number.
It is not a de Polignac number, because 150010169 - 28 = 150009913 is a prime.
It is a super-2 number, since 2×1500101692 = 45006101606817122, which contains 22 as substring.
Together with 150010171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (150010139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75005084 + 75005085.
It is an arithmetic number, because the mean of its divisors is an integer number (75005085).
Almost surely, 2150010169 is an apocalyptic number.
It is an amenable number.
150010169 is a deficient number, since it is larger than the sum of its proper divisors (1).
150010169 is an equidigital number, since it uses as much as digits as its factorization.
150010169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
The square root of 150010169 is about 12247.8638545666. The cubic root of 150010169 is about 531.3412911811.
The spelling of 150010169 in words is "one hundred fifty million, ten thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •