Base | Representation |
---|---|
bin | 1111101111110… |
… | …00101100100101 |
3 | 100012112220022201 |
4 | 13313320230211 |
5 | 232303400121 |
6 | 21035054501 |
7 | 3162515653 |
oct | 767705445 |
9 | 305486281 |
10 | 132090661 |
11 | 6861a73a |
12 | 382a1431 |
13 | 2149b271 |
14 | 13785dd3 |
15 | b8e2e91 |
hex | 7df8b25 |
132090661 has 4 divisors (see below), whose sum is σ = 132133324. Its totient is φ = 132048000.
The previous prime is 132090649. The next prime is 132090671. The reversal of 132090661 is 166090231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 166090231 = 6599 ⋅25169.
It can be written as a sum of positive squares in 2 ways, for example, as 69205761 + 62884900 = 8319^2 + 7930^2 .
It is a cyclic number.
It is not a de Polignac number, because 132090661 - 29 = 132090149 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 (132090611) 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, 16290 + ... + 23011.
It is an arithmetic number, because the mean of its divisors is an integer number (33033331).
Almost surely, 2132090661 is an apocalyptic number.
It is an amenable number.
132090661 is a deficient number, since it is larger than the sum of its proper divisors (42663).
132090661 is an equidigital number, since it uses as much as digits as its factorization.
132090661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42662.
The product of its (nonzero) digits is 1944, while the sum is 28.
The square root of 132090661 is about 11493.0701294302. The cubic root of 132090661 is about 509.2808793491.
The spelling of 132090661 in words is "one hundred thirty-two million, ninety thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •