Base | Representation |
---|---|
bin | 10001111000111… |
… | …01011110101101 |
3 | 101110101012101101 |
4 | 20330131132231 |
5 | 301404121432 |
6 | 22520243101 |
7 | 3501356314 |
oct | 1074353655 |
9 | 343335341 |
10 | 150067117 |
11 | 77788712 |
12 | 42310491 |
13 | 25123615 |
14 | 15d0527b |
15 | d2944e7 |
hex | 8f1d7ad |
150067117 has 2 divisors, whose sum is σ = 150067118. Its totient is φ = 150067116.
The previous prime is 150067103. The next prime is 150067123. The reversal of 150067117 is 711760051.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90992521 + 59074596 = 9539^2 + 7686^2 .
It is an emirp because it is prime and its reverse (711760051) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150067117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150067147) 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, 75033558 + 75033559.
It is an arithmetic number, because the mean of its divisors is an integer number (75033559).
Almost surely, 2150067117 is an apocalyptic number.
It is an amenable number.
150067117 is a deficient number, since it is larger than the sum of its proper divisors (1).
150067117 is an equidigital number, since it uses as much as digits as its factorization.
150067117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1470, while the sum is 28.
The square root of 150067117 is about 12250.1884475301. The cubic root of 150067117 is about 531.4085199470.
The spelling of 150067117 in words is "one hundred fifty million, sixty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •