Base | Representation |
---|---|
bin | 1111101111101… |
… | …00011010111110 |
3 | 100012112000022011 |
4 | 13313310122332 |
5 | 232302320100 |
6 | 21034441434 |
7 | 3162413626 |
oct | 767643276 |
9 | 305460264 |
10 | 132073150 |
11 | 68608570 |
12 | 3829327a |
13 | 214932c1 |
14 | 1377d886 |
15 | b8dcbba |
hex | 7df46be |
132073150 has 48 divisors (see below), whose sum is σ = 269089920. Its totient is φ = 47829600.
The previous prime is 132073141. The next prime is 132073159. The reversal of 132073150 is 51370231.
It is an interprime number because it is at equal distance from previous prime (132073141) and next prime (132073159).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132073159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 241177 + ... + 241723.
It is an arithmetic number, because the mean of its divisors is an integer number (5606040).
Almost surely, 2132073150 is an apocalyptic number.
132073150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132073150 is an abundant number, since it is smaller than the sum of its proper divisors (137016770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132073150 is a wasteful number, since it uses less digits than its factorization.
132073150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009 (or 1004 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 22.
The square root of 132073150 is about 11492.3082972917. The cubic root of 132073150 is about 509.2583735652.
The spelling of 132073150 in words is "one hundred thirty-two million, seventy-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •