Base | Representation |
---|---|
bin | 10001111011101… |
… | …00111100001000 |
3 | 101111001101210100 |
4 | 20331310330020 |
5 | 302002102402 |
6 | 22532045400 |
7 | 3504410610 |
oct | 1075647410 |
9 | 344041710 |
10 | 150425352 |
11 | 77a02880 |
12 | 42463860 |
13 | 2521a6ac |
14 | 15d99a40 |
15 | d31571c |
hex | 8f74f08 |
150425352 has 192 divisors, whose sum is σ = 520565760. Its totient is φ = 38102400.
The previous prime is 150425339. The next prime is 150425377. The reversal of 150425352 is 253524051.
It is a happy number.
150425352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 238077 + ... + 238707.
It is an arithmetic number, because the mean of its divisors is an integer number (2711280).
Almost surely, 2150425352 is an apocalyptic number.
150425352 is a gapful number since it is divisible by the number (12) 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 150425352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260282880).
150425352 is an abundant number, since it is smaller than the sum of its proper divisors (370140408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150425352 is a wasteful number, since it uses less digits than its factorization.
150425352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 704 (or 697 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 150425352 is about 12264.8013436827. The cubic root of 150425352 is about 531.8310372283.
The spelling of 150425352 in words is "one hundred fifty million, four hundred twenty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •