Base | Representation |
---|---|
bin | 1111110110011… |
… | …00000101110101 |
3 | 100021011220002001 |
4 | 13323030011311 |
5 | 233014102113 |
6 | 21105415301 |
7 | 3203053243 |
oct | 773140565 |
9 | 307156061 |
10 | 132956533 |
11 | 69061236 |
12 | 3863a531 |
13 | 21712408 |
14 | 1392d793 |
15 | ba147dd |
hex | 7ecc175 |
132956533 has 4 divisors (see below), whose sum is σ = 133253100. Its totient is φ = 132659968.
The previous prime is 132956531. The next prime is 132956539. The reversal of 132956533 is 335659231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 335659231 = 193 ⋅1739167.
It can be written as a sum of positive squares in 2 ways, for example, as 54066609 + 78889924 = 7353^2 + 8882^2 .
It is a cyclic number.
It is not a de Polignac number, because 132956533 - 21 = 132956531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132956492 and 132956501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132956531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147610 + ... + 148507.
It is an arithmetic number, because the mean of its divisors is an integer number (33313275).
Almost surely, 2132956533 is an apocalyptic number.
It is an amenable number.
132956533 is a deficient number, since it is larger than the sum of its proper divisors (296567).
132956533 is an equidigital number, since it uses as much as digits as its factorization.
132956533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296566.
The product of its digits is 72900, while the sum is 37.
The square root of 132956533 is about 11530.6779072178. The cubic root of 132956533 is about 510.3912581356.
The spelling of 132956533 in words is "one hundred thirty-two million, nine hundred fifty-six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •