Base | Representation |
---|---|
bin | 10001111011101… |
… | …00111001000000 |
3 | 101111001101111221 |
4 | 20331310321000 |
5 | 302002101102 |
6 | 22532044424 |
7 | 3504410203 |
oct | 1075647100 |
9 | 344041457 |
10 | 150425152 |
11 | 77a02709 |
12 | 42463714 |
13 | 2521a587 |
14 | 15d9993a |
15 | d315637 |
hex | 8f74e40 |
150425152 has 28 divisors (see below), whose sum is σ = 311481216. Its totient is φ = 71941760.
The previous prime is 150425141. The next prime is 150425153. The reversal of 150425152 is 251524051.
It is a super-3 number, since 3×1504251523 (a number of 26 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (150425153) 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 3 ways as a sum of consecutive naturals, for example, 49624 + ... + 52567.
Almost surely, 2150425152 is an apocalyptic number.
It is an amenable number.
150425152 is an abundant number, since it is smaller than the sum of its proper divisors (161056064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150425152 is a wasteful number, since it uses less digits than its factorization.
150425152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102226 (or 102216 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 150425152 is about 12264.7931902662. The cubic root of 150425152 is about 531.8308015273.
The spelling of 150425152 in words is "one hundred fifty million, four hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •