Base | Representation |
---|---|
bin | 1111110001010… |
… | …11110101001101 |
3 | 100012221112122001 |
4 | 13320223311031 |
5 | 232332100414 |
6 | 21043352301 |
7 | 3164350414 |
oct | 770536515 |
9 | 305845561 |
10 | 132300109 |
11 | 68753037 |
12 | 38382691 |
13 | 215426b6 |
14 | 137dc47b |
15 | b935074 |
hex | 7e2bd4d |
132300109 has 4 divisors (see below), whose sum is σ = 132487420. Its totient is φ = 132112800.
The previous prime is 132300107. The next prime is 132300127. The reversal of 132300109 is 901003231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 901003231 = 283 ⋅3183757.
It can be written as a sum of positive squares in 2 ways, for example, as 59675625 + 72624484 = 7725^2 + 8522^2 .
It is a cyclic number.
It is not a de Polignac number, because 132300109 - 21 = 132300107 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 (132300107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92592 + ... + 94009.
It is an arithmetic number, because the mean of its divisors is an integer number (33121855).
Almost surely, 2132300109 is an apocalyptic number.
It is an amenable number.
132300109 is a deficient number, since it is larger than the sum of its proper divisors (187311).
132300109 is an equidigital number, since it uses as much as digits as its factorization.
132300109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187310.
The product of its (nonzero) digits is 162, while the sum is 19.
The square root of 132300109 is about 11502.1784458423. The cubic root of 132300109 is about 509.5499156093.
The spelling of 132300109 in words is "one hundred thirty-two million, three hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •