Base | Representation |
---|---|
bin | 1111110000111… |
… | …00001111100101 |
3 | 100012211022001022 |
4 | 13320130033211 |
5 | 232323030021 |
6 | 21042140525 |
7 | 3163663313 |
oct | 770341745 |
9 | 305738038 |
10 | 132236261 |
11 | 6870a073 |
12 | 38351745 |
13 | 2151c611 |
14 | 137c30b3 |
15 | b9211ab |
hex | 7e1c3e5 |
132236261 has 4 divisors (see below), whose sum is σ = 135810252. Its totient is φ = 128662272.
The previous prime is 132236249. The next prime is 132236263. The reversal of 132236261 is 162632231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 126135361 + 6100900 = 11231^2 + 2470^2 .
It is a cyclic number.
It is not a de Polignac number, because 132236261 - 26 = 132236197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132236261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132236263) 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, 1786940 + ... + 1787013.
It is an arithmetic number, because the mean of its divisors is an integer number (33952563).
Almost surely, 2132236261 is an apocalyptic number.
It is an amenable number.
132236261 is a deficient number, since it is larger than the sum of its proper divisors (3573991).
132236261 is an equidigital number, since it uses as much as digits as its factorization.
132236261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3573990.
The product of its digits is 2592, while the sum is 26.
The square root of 132236261 is about 11499.4026366590. The cubic root of 132236261 is about 509.4679328651.
Adding to 132236261 its reverse (162632231), we get a palindrome (294868492).
The spelling of 132236261 in words is "one hundred thirty-two million, two hundred thirty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •