Base | Representation |
---|---|
bin | 1111110011010… |
… | …01110110011001 |
3 | 100020102110002111 |
4 | 13321221312121 |
5 | 232413213022 |
6 | 21053032321 |
7 | 3166456132 |
oct | 771516631 |
9 | 306373074 |
10 | 132554137 |
11 | 68906981 |
12 | 384856a1 |
13 | 21601201 |
14 | 13866c89 |
15 | b985477 |
hex | 7e69d99 |
132554137 has 8 divisors (see below), whose sum is σ = 134484680. Its totient is φ = 130636800.
The previous prime is 132554119. The next prime is 132554173. The reversal of 132554137 is 731455231.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 21799561 + 110754576 = 4669^2 + 10524^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132554137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132554099 and 132554108.
It is not an unprimeable number, because it can be changed into a prime (132554437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17887 + ... + 24187.
It is an arithmetic number, because the mean of its divisors is an integer number (16810585).
Almost surely, 2132554137 is an apocalyptic number.
It is an amenable number.
132554137 is a deficient number, since it is larger than the sum of its proper divisors (1930543).
132554137 is a wasteful number, since it uses less digits than its factorization.
132554137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6603.
The product of its digits is 12600, while the sum is 31.
The square root of 132554137 is about 11513.2157540802. The cubic root of 132554137 is about 509.8758341839.
The spelling of 132554137 in words is "one hundred thirty-two million, five hundred fifty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •