Base | Representation |
---|---|
bin | 10001111010101… |
… | …11000110001001 |
3 | 101110211012002222 |
4 | 20331113012021 |
5 | 301434144423 |
6 | 22525303425 |
7 | 3503361332 |
oct | 1075270611 |
9 | 343735088 |
10 | 150303113 |
11 | 77929a54 |
12 | 42404b75 |
13 | 251a6b6c |
14 | 15d67289 |
15 | d2de3c8 |
hex | 8f57189 |
150303113 has 2 divisors, whose sum is σ = 150303114. Its totient is φ = 150303112.
The previous prime is 150303079. The next prime is 150303121. The reversal of 150303113 is 311303051.
150303113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 142969849 + 7333264 = 11957^2 + 2708^2 .
It is a cyclic number.
It is not a de Polignac number, because 150303113 - 28 = 150302857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 150303091 and 150303100.
It is not a weakly prime, because it can be changed into another prime (150303163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75151556 + 75151557.
It is an arithmetic number, because the mean of its divisors is an integer number (75151557).
Almost surely, 2150303113 is an apocalyptic number.
It is an amenable number.
150303113 is a deficient number, since it is larger than the sum of its proper divisors (1).
150303113 is an equidigital number, since it uses as much as digits as its factorization.
150303113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 150303113 is about 12259.8170051596. The cubic root of 150303113 is about 531.6869389300.
Adding to 150303113 its reverse (311303051), we get a palindrome (461606164).
The spelling of 150303113 in words is "one hundred fifty million, three hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •