Base | Representation |
---|---|
bin | 10001111010101… |
… | …10110101100100 |
3 | 101110211010122200 |
4 | 20331112311210 |
5 | 301434131202 |
6 | 22525254500 |
7 | 3503355255 |
oct | 1075266544 |
9 | 343733580 |
10 | 150302052 |
11 | 7792917a |
12 | 42404430 |
13 | 251a6534 |
14 | 15d66b2c |
15 | d2dde1c |
hex | 8f56d64 |
150302052 has 72 divisors (see below), whose sum is σ = 390778752. Its totient is φ = 48686400.
The previous prime is 150302051. The next prime is 150302069. The reversal of 150302052 is 250203051.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (150302051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 356802 + ... + 357222.
Almost surely, 2150302052 is an apocalyptic number.
150302052 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 150302052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195389376).
150302052 is an abundant number, since it is smaller than the sum of its proper divisors (240476700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150302052 is a wasteful number, since it uses less digits than its factorization.
150302052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689 (or 684 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 150302052 is about 12259.7737336380. The cubic root of 150302052 is about 531.6856878555.
Subtracting 150302052 from its reverse (250203051), we obtain a palindrome (99900999).
The spelling of 150302052 in words is "one hundred fifty million, three hundred two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •