Base | Representation |
---|---|
bin | 10001111101011… |
… | …11011111000000 |
3 | 101111111120201211 |
4 | 20332233133000 |
5 | 302032241102 |
6 | 22541135504 |
7 | 3506430001 |
oct | 1076573700 |
9 | 344446654 |
10 | 150665152 |
11 | 78056a60 |
12 | 4255a594 |
13 | 252a28a1 |
14 | 1601d1a8 |
15 | d3617d7 |
hex | 8faf7c0 |
150665152 has 56 divisors (see below), whose sum is σ = 345368880. Its totient is φ = 64450560.
The previous prime is 150665113. The next prime is 150665171. The reversal of 150665152 is 251566051.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5674 + ... + 18262.
Almost surely, 2150665152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 150665152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172684440).
150665152 is an abundant number, since it is smaller than the sum of its proper divisors (194703728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150665152 is a wasteful number, since it uses less digits than its factorization.
150665152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12629 (or 12619 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
The square root of 150665152 is about 12274.5733938088. The cubic root of 150665152 is about 532.1134926615.
The spelling of 150665152 in words is "one hundred fifty million, six hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •