Base | Representation |
---|---|
bin | 10001111000011… |
… | …01011001000101 |
3 | 101110020211222210 |
4 | 20330031121011 |
5 | 301400014341 |
6 | 22515014033 |
7 | 3500663226 |
oct | 1074153105 |
9 | 343224883 |
10 | 150001221 |
11 | 77743157 |
12 | 4229a319 |
13 | 250cc626 |
14 | 15cc924d |
15 | d27ec16 |
hex | 8f0d645 |
150001221 has 8 divisors (see below), whose sum is σ = 200199744. Its totient is φ = 99901760.
The previous prime is 150001213. The next prime is 150001231. The reversal of 150001221 is 122100051.
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 150001221 - 23 = 150001213 is a prime.
150001221 is a modest number, since divided by 1221 gives 150 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 150001197 and 150001206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150001211) 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, 21156 + ... + 27341.
It is an arithmetic number, because the mean of its divisors is an integer number (25024968).
Almost surely, 2150001221 is an apocalyptic number.
It is an amenable number.
150001221 is a deficient number, since it is larger than the sum of its proper divisors (50198523).
150001221 is a wasteful number, since it uses less digits than its factorization.
150001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49531.
The product of its (nonzero) digits is 20, while the sum is 12.
The square root of 150001221 is about 12247.4985609307. The cubic root of 150001221 is about 531.3307262609.
Adding to 150001221 its reverse (122100051), we get a palindrome (272101272).
The spelling of 150001221 in words is "one hundred fifty million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •