Base | Representation |
---|---|
bin | 10001111101110… |
… | …10001111100101 |
3 | 101111120211012000 |
4 | 20332322033211 |
5 | 302040143341 |
6 | 22542115513 |
7 | 3510002325 |
oct | 1076721745 |
9 | 344524160 |
10 | 150709221 |
11 | 78087083 |
12 | 4257bb99 |
13 | 252b9970 |
14 | 16031285 |
15 | d36e8b6 |
hex | 8fba3e5 |
150709221 has 32 divisors (see below), whose sum is σ = 242256000. Its totient is φ = 92047104.
The previous prime is 150709219. The next prime is 150709231. The reversal of 150709221 is 122907051.
It is not a de Polignac number, because 150709221 - 21 = 150709219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150709211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47245 + ... + 50333.
It is an arithmetic number, because the mean of its divisors is an integer number (7570500).
Almost surely, 2150709221 is an apocalyptic number.
It is an amenable number.
150709221 is a deficient number, since it is larger than the sum of its proper divisors (91546779).
150709221 is a wasteful number, since it uses less digits than its factorization.
150709221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3250 (or 3244 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 150709221 is about 12276.3683962318. The cubic root of 150709221 is about 532.1653680139.
The spelling of 150709221 in words is "one hundred fifty million, seven hundred nine thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •