Base | Representation |
---|---|
bin | 1111110011111… |
… | …11110110011010 |
3 | 100020121000201000 |
4 | 13321333312122 |
5 | 232424104000 |
6 | 21055005430 |
7 | 3200312634 |
oct | 771776632 |
9 | 306530630 |
10 | 132644250 |
11 | 68968652 |
12 | 38509876 |
13 | 2163322b |
14 | 1388ba54 |
15 | b9a2000 |
hex | 7e7fd9a |
132644250 has 128 divisors (see below), whose sum is σ = 377245440. Its totient is φ = 34473600.
The previous prime is 132644233. The next prime is 132644269. The reversal of 132644250 is 52446231.
132644250 is a `hidden beast` number, since 13 + 2 + 644 + 2 + 5 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 290022 + ... + 290478.
It is an arithmetic number, because the mean of its divisors is an integer number (2947230).
Almost surely, 2132644250 is an apocalyptic number.
132644250 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 132644250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188622720).
132644250 is an abundant number, since it is smaller than the sum of its proper divisors (244601190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132644250 is a wasteful number, since it uses less digits than its factorization.
132644250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526 (or 510 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 132644250 is about 11517.1285483839. The cubic root of 132644250 is about 509.9913493342.
The spelling of 132644250 in words is "one hundred thirty-two million, six hundred forty-four thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •