Base | Representation |
---|---|
bin | 10001111000111… |
… | …01010101000100 |
3 | 101110101011112112 |
4 | 20330131111010 |
5 | 301404112000 |
6 | 22520240152 |
7 | 3501354443 |
oct | 1074352504 |
9 | 343334475 |
10 | 150066500 |
11 | 77788201 |
12 | 42310058 |
13 | 2512325c |
14 | 15d04d5a |
15 | d294235 |
hex | 8f1d544 |
150066500 has 48 divisors (see below), whose sum is σ = 333365760. Its totient is φ = 58997600.
The previous prime is 150066493. The next prime is 150066509. The reversal of 150066500 is 5660051.
It is not an unprimeable number, because it can be changed into a prime (150066509) 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 15 ways as a sum of consecutive naturals, for example, 26957 + ... + 32043.
It is an arithmetic number, because the mean of its divisors is an integer number (6945120).
Almost surely, 2150066500 is an apocalyptic number.
150066500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 150066500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166682880).
150066500 is an abundant number, since it is smaller than the sum of its proper divisors (183299260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150066500 is a wasteful number, since it uses less digits than its factorization.
150066500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5165 (or 5153 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 150066500 is about 12250.1632642182. The cubic root of 150066500 is about 531.4077916518.
The spelling of 150066500 in words is "one hundred fifty million, sixty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •