Base | Representation |
---|---|
bin | 10001111100101… |
… | …10110101111111 |
3 | 101111022110021201 |
4 | 20332112311333 |
5 | 302021023343 |
6 | 22535040331 |
7 | 3505526515 |
oct | 1076266577 |
9 | 344273251 |
10 | 150564223 |
11 | 77a98147 |
12 | 425100a7 |
13 | 25268974 |
14 | 15dd44b5 |
15 | d34194d |
hex | 8f96d7f |
150564223 has 8 divisors (see below), whose sum is σ = 159567840. Its totient is φ = 141576960.
The previous prime is 150564217. The next prime is 150564229. The reversal of 150564223 is 322465051.
It is an interprime number because it is at equal distance from previous prime (150564217) and next prime (150564229).
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 150564223 - 29 = 150563711 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150564191 and 150564200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150564229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18478 + ... + 25348.
It is an arithmetic number, because the mean of its divisors is an integer number (19945980).
Almost surely, 2150564223 is an apocalyptic number.
150564223 is a deficient number, since it is larger than the sum of its proper divisors (9003617).
150564223 is a wasteful number, since it uses less digits than its factorization.
150564223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8177.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 150564223 is about 12270.4614012677. The cubic root of 150564223 is about 531.9946470432.
The spelling of 150564223 in words is "one hundred fifty million, five hundred sixty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •