Base | Representation |
---|---|
bin | 10001111100010… |
… | …00110011001100 |
3 | 101111012112101020 |
4 | 20332020303030 |
5 | 302012203300 |
6 | 22533514140 |
7 | 3505200021 |
oct | 1076106314 |
9 | 344175336 |
10 | 150506700 |
11 | 77a58a03 |
12 | 424a2950 |
13 | 25248726 |
14 | 15dbb548 |
15 | d32e8a0 |
hex | 8f88ccc |
150506700 has 72 divisors (see below), whose sum is σ = 436972032. Its totient is φ = 39996480.
The previous prime is 150506689. The next prime is 150506701. The reversal of 150506700 is 7605051.
It is not an unprimeable number, because it can be changed into a prime (150506701) 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 23 ways as a sum of consecutive naturals, for example, 109417 + ... + 110783.
It is an arithmetic number, because the mean of its divisors is an integer number (6069056).
Almost surely, 2150506700 is an apocalyptic number.
150506700 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 150506700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218486016).
150506700 is an abundant number, since it is smaller than the sum of its proper divisors (286465332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150506700 is a wasteful number, since it uses less digits than its factorization.
150506700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751 (or 1744 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 24.
The square root of 150506700 is about 12268.1172149601. The cubic root of 150506700 is about 531.9268889675.
The spelling of 150506700 in words is "one hundred fifty million, five hundred six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •