Base | Representation |
---|---|
bin | 1111110011111… |
… | …11000110110101 |
3 | 100020120212112020 |
4 | 13321333012311 |
5 | 232424004310 |
6 | 21054543353 |
7 | 3200301024 |
oct | 771770665 |
9 | 306525466 |
10 | 132641205 |
11 | 68966334 |
12 | 38507b59 |
13 | 21631a28 |
14 | 1388a8bb |
15 | b9a1170 |
hex | 7e7f1b5 |
132641205 has 8 divisors (see below), whose sum is σ = 212225952. Its totient is φ = 70741968.
The previous prime is 132641203. The next prime is 132641227. The reversal of 132641205 is 502146231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132641205 - 21 = 132641203 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132641203) 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 7 ways as a sum of consecutive naturals, for example, 4421359 + ... + 4421388.
It is an arithmetic number, because the mean of its divisors is an integer number (26528244).
Almost surely, 2132641205 is an apocalyptic number.
132641205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132641205 is a deficient number, since it is larger than the sum of its proper divisors (79584747).
132641205 is an equidigital number, since it uses as much as digits as its factorization.
132641205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8842755.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 132641205 is about 11516.9963532164. The cubic root of 132641205 is about 509.9874468267.
Adding to 132641205 its reverse (502146231), we get a palindrome (634787436).
The spelling of 132641205 in words is "one hundred thirty-two million, six hundred forty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •