Base | Representation |
---|---|
bin | 1111110010111… |
… | …01101110000010 |
3 | 100020022220221020 |
4 | 13321131232002 |
5 | 232410120300 |
6 | 21052010310 |
7 | 3166161231 |
oct | 771355602 |
9 | 306286836 |
10 | 132504450 |
11 | 68882611 |
12 | 38460996 |
13 | 215b4700 |
14 | 13852b18 |
15 | b9758a0 |
hex | 7e5db82 |
132504450 has 72 divisors (see below), whose sum is σ = 355901328. Its totient is φ = 32610240.
The previous prime is 132504439. The next prime is 132504467. The reversal of 132504450 is 54405231.
It is a self number, because there is not a number n which added to its sum of digits gives 132504450.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 22737 + ... + 27963.
It is an arithmetic number, because the mean of its divisors is an integer number (4943074).
Almost surely, 2132504450 is an apocalyptic number.
132504450 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 132504450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177950664).
132504450 is an abundant number, since it is smaller than the sum of its proper divisors (223396878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132504450 is a wasteful number, since it uses less digits than its factorization.
132504450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5268 (or 5250 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 132504450 is about 11511.0577272464. The cubic root of 132504450 is about 509.8121184140.
Adding to 132504450 its reverse (54405231), we get a palindrome (186909681).
The spelling of 132504450 in words is "one hundred thirty-two million, five hundred four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •