Base | Representation |
---|---|
bin | 1111110010111… |
… | …01111001101011 |
3 | 100020022221221211 |
4 | 13321131321223 |
5 | 232410131240 |
6 | 21052013551 |
7 | 3166163344 |
oct | 771357153 |
9 | 306287854 |
10 | 132505195 |
11 | 68883129 |
12 | 384612b7 |
13 | 215b4b54 |
14 | 138530cb |
15 | b975bea |
hex | 7e5de6b |
132505195 has 4 divisors (see below), whose sum is σ = 159006240. Its totient is φ = 106004152.
The previous prime is 132505193. The next prime is 132505207. The reversal of 132505195 is 591505231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 591505231 = 389 ⋅1520579.
It is a cyclic number.
It is not a de Polignac number, because 132505195 - 21 = 132505193 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (132505193) 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 3 ways as a sum of consecutive naturals, for example, 13250515 + ... + 13250524.
It is an arithmetic number, because the mean of its divisors is an integer number (39751560).
Almost surely, 2132505195 is an apocalyptic number.
132505195 is a deficient number, since it is larger than the sum of its proper divisors (26501045).
132505195 is an equidigital number, since it uses as much as digits as its factorization.
132505195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26501044.
The product of its (nonzero) digits is 6750, while the sum is 31.
The square root of 132505195 is about 11511.0900873896. The cubic root of 132505195 is about 509.8130738770.
The spelling of 132505195 in words is "one hundred thirty-two million, five hundred five thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •