Base | Representation |
---|---|
bin | 10010001010001… |
… | …00110101001010 |
3 | 101121121221020100 |
4 | 21011010311022 |
5 | 302443403300 |
6 | 23040510230 |
7 | 3526513344 |
oct | 1105046512 |
9 | 347557210 |
10 | 152325450 |
11 | 78a90402 |
12 | 4301b376 |
13 | 25734504 |
14 | 16332294 |
15 | d58d700 |
hex | 9144d4a |
152325450 has 72 divisors (see below), whose sum is σ = 414943308. Its totient is φ = 40055040.
The previous prime is 152325427. The next prime is 152325461. The reversal of 152325450 is 54523251.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 41254929 + 111070521 = 6423^2 + 10539^2 .
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 30532 + ... + 35168.
Almost surely, 2152325450 is an apocalyptic number.
152325450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 152325450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207471654).
152325450 is an abundant number, since it is smaller than the sum of its proper divisors (262617858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152325450 is a wasteful number, since it uses less digits than its factorization.
152325450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4728 (or 4720 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 152325450 is about 12342.0196888516. The cubic root of 152325450 is about 534.0609491514.
The spelling of 152325450 in words is "one hundred fifty-two million, three hundred twenty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •