Base | Representation |
---|---|
bin | 10001111010000… |
… | …11000011010011 |
3 | 101110200000111011 |
4 | 20331003003103 |
5 | 301424033021 |
6 | 22523431351 |
7 | 3502600063 |
oct | 1075030323 |
9 | 343600434 |
10 | 150221011 |
11 | 778832a6 |
12 | 42385557 |
13 | 25178695 |
14 | 15d453a3 |
15 | d2c4de1 |
hex | 8f430d3 |
150221011 has 4 divisors (see below), whose sum is σ = 158127400. Its totient is φ = 142314624.
The previous prime is 150220943. The next prime is 150221017. The reversal of 150221011 is 110122051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110122051 = 13 ⋅8470927.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150221011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150220982 and 150221000.
It is not an unprimeable number, because it can be changed into a prime (150221017) 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 3 ways as a sum of consecutive naturals, for example, 3953166 + ... + 3953203.
It is an arithmetic number, because the mean of its divisors is an integer number (39531850).
Almost surely, 2150221011 is an apocalyptic number.
150221011 is a deficient number, since it is larger than the sum of its proper divisors (7906389).
150221011 is an equidigital number, since it uses as much as digits as its factorization.
150221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7906388.
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 150221011 is about 12256.4681291145. The cubic root of 150221011 is about 531.5901112354.
Adding to 150221011 its reverse (110122051), we get a palindrome (260343062).
The spelling of 150221011 in words is "one hundred fifty million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •