Base | Representation |
---|---|
bin | 1111101111111… |
… | …01000111001101 |
3 | 100012120211010122 |
4 | 13313331013031 |
5 | 232304434444 |
6 | 21035314325 |
7 | 3162622463 |
oct | 767750715 |
9 | 305524118 |
10 | 132108749 |
11 | 68632293 |
12 | 382ab9a5 |
13 | 214a6576 |
14 | 1378c833 |
15 | b8e84ee |
hex | 7dfd1cd |
132108749 has 4 divisors (see below), whose sum is σ = 132950364. Its totient is φ = 131267136.
The previous prime is 132108721. The next prime is 132108773. The reversal of 132108749 is 947801231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 947801231 = 13 ⋅72907787.
It can be written as a sum of positive squares in 2 ways, for example, as 95687524 + 36421225 = 9782^2 + 6035^2 .
It is a cyclic number.
It is not a de Polignac number, because 132108749 - 212 = 132104653 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 (132108149) 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, 420572 + ... + 420885.
It is an arithmetic number, because the mean of its divisors is an integer number (33237591).
Almost surely, 2132108749 is an apocalyptic number.
It is an amenable number.
132108749 is a deficient number, since it is larger than the sum of its proper divisors (841615).
132108749 is an equidigital number, since it uses as much as digits as its factorization.
132108749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841614.
The product of its (nonzero) digits is 12096, while the sum is 35.
The square root of 132108749 is about 11493.8570114649. The cubic root of 132108749 is about 509.3041246263.
The spelling of 132108749 in words is "one hundred thirty-two million, one hundred eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •