Base | Representation |
---|---|
bin | 1111110010111… |
… | …01001011110101 |
3 | 100020022210221011 |
4 | 13321131023311 |
5 | 232410033021 |
6 | 21051552221 |
7 | 3166151653 |
oct | 771351365 |
9 | 306283834 |
10 | 132502261 |
11 | 68880a01 |
12 | 3845b671 |
13 | 215b3708 |
14 | 13851dd3 |
15 | b974de1 |
hex | 7e5d2f5 |
132502261 has 8 divisors (see below), whose sum is σ = 133403544. Its totient is φ = 131604480.
The previous prime is 132502231. The next prime is 132502289. The reversal of 132502261 is 162205231.
It can be written as a sum of positive squares in 4 ways, for example, as 45900625 + 86601636 = 6775^2 + 9306^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132502261 - 25 = 132502229 is a prime.
It is a super-2 number, since 2×1325022612 = 35113698340224242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132502231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138561 + ... + 139513.
It is an arithmetic number, because the mean of its divisors is an integer number (16675443).
Almost surely, 2132502261 is an apocalyptic number.
It is an amenable number.
132502261 is a deficient number, since it is larger than the sum of its proper divisors (901283).
132502261 is an equidigital number, since it uses as much as digits as its factorization.
132502261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1751.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 132502261 is about 11510.9626443665. The cubic root of 132502261 is about 509.8093109991.
Adding to 132502261 its reverse (162205231), we get a palindrome (294707492).
The spelling of 132502261 in words is "one hundred thirty-two million, five hundred two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •