Base | Representation |
---|---|
bin | 10001111010010… |
… | …11100101010000 |
3 | 101110201210102021 |
4 | 20331023211100 |
5 | 301431142302 |
6 | 22524301224 |
7 | 3503104000 |
oct | 1075134520 |
9 | 343653367 |
10 | 150255952 |
11 | 778a7580 |
12 | 423a1814 |
13 | 2518b562 |
14 | 15d54000 |
15 | d2d0437 |
hex | 8f4b950 |
150255952 has 160 divisors (see below), whose sum is σ = 392832000. Its totient is φ = 55036800.
The previous prime is 150255947. The next prime is 150255961. The reversal of 150255952 is 259552051.
It is a happy number.
It is a super-2 number, since 2×1502559522 = 45153702222852608, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1146927 + ... + 1147057.
It is an arithmetic number, because the mean of its divisors is an integer number (2455200).
Almost surely, 2150255952 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 150255952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196416000).
150255952 is an abundant number, since it is smaller than the sum of its proper divisors (242576048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150255952 is a wasteful number, since it uses less digits than its factorization.
150255952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190 (or 170 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
The square root of 150255952 is about 12257.8934568710. The cubic root of 150255952 is about 531.6313235132.
The spelling of 150255952 in words is "one hundred fifty million, two hundred fifty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •