Base | Representation |
---|---|
bin | 1111110000100… |
… | …10001110000101 |
3 | 100012202012201201 |
4 | 13320102032011 |
5 | 232320221310 |
6 | 21041222501 |
7 | 3163432522 |
oct | 770221605 |
9 | 305665651 |
10 | 132195205 |
11 | 6869123a |
12 | 38331a31 |
13 | 21506a1c |
14 | 137b2149 |
15 | b913e3a |
hex | 7e12385 |
132195205 has 4 divisors (see below), whose sum is σ = 158634252. Its totient is φ = 105756160.
The previous prime is 132195199. The next prime is 132195209. The reversal of 132195205 is 502591231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 502591231 = 1187 ⋅423413.
It can be written as a sum of positive squares in 2 ways, for example, as 42211009 + 89984196 = 6497^2 + 9486^2 .
It is not a de Polignac number, because 132195205 - 29 = 132194693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132195209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13219516 + ... + 13219525.
It is an arithmetic number, because the mean of its divisors is an integer number (39658563).
Almost surely, 2132195205 is an apocalyptic number.
It is an amenable number.
132195205 is a deficient number, since it is larger than the sum of its proper divisors (26439047).
132195205 is an equidigital number, since it uses as much as digits as its factorization.
132195205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26439046.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 132195205 is about 11497.6173618711. The cubic root of 132195205 is about 509.4152017902.
The spelling of 132195205 in words is "one hundred thirty-two million, one hundred ninety-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •