Base | Representation |
---|---|
bin | 10001111011001… |
… | …10000101100001 |
3 | 101110221022100001 |
4 | 20331212011201 |
5 | 301443131023 |
6 | 22530500001 |
7 | 3504035335 |
oct | 1075460541 |
9 | 343838301 |
10 | 150364513 |
11 | 779710a2 |
12 | 42434601 |
13 | 251c8ab0 |
14 | 15d817c5 |
15 | d3026ad |
hex | 8f66161 |
150364513 has 8 divisors (see below), whose sum is σ = 162102248. Its totient is φ = 138651264.
The previous prime is 150364493. The next prime is 150364517. The reversal of 150364513 is 315463051.
It can be written as a sum of positive squares in 4 ways, for example, as 18045504 + 132319009 = 4248^2 + 11503^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150364513 - 213 = 150356321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150364517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7831 + ... + 19027.
It is an arithmetic number, because the mean of its divisors is an integer number (20262781).
Almost surely, 2150364513 is an apocalyptic number.
150364513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
150364513 is a deficient number, since it is larger than the sum of its proper divisors (11737735).
150364513 is a wasteful number, since it uses less digits than its factorization.
150364513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12243.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 150364513 is about 12262.3208651544. The cubic root of 150364513 is about 531.7593285012.
The spelling of 150364513 in words is "one hundred fifty million, three hundred sixty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •