Base | Representation |
---|---|
bin | 1111110000001… |
… | …00111000111101 |
3 | 100012122102211111 |
4 | 13320010320331 |
5 | 232311444410 |
6 | 21040122021 |
7 | 3163114402 |
oct | 770047075 |
9 | 305572744 |
10 | 132140605 |
11 | 68654213 |
12 | 38306311 |
13 | 214b7c0c |
14 | 1379a2a9 |
15 | b902b8a |
hex | 7e04e3d |
132140605 has 4 divisors (see below), whose sum is σ = 158568732. Its totient is φ = 105712480.
The previous prime is 132140599. The next prime is 132140629. The reversal of 132140605 is 506041231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506041231 = 19 ⋅26633749.
It can be written as a sum of positive squares in 2 ways, for example, as 29138404 + 103002201 = 5398^2 + 10149^2 .
It is not a de Polignac number, because 132140605 - 211 = 132138557 is a prime.
It is a super-2 number, since 2×1321406052 = 34922278979532050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13214056 + ... + 13214065.
It is an arithmetic number, because the mean of its divisors is an integer number (39642183).
Almost surely, 2132140605 is an apocalyptic number.
It is an amenable number.
132140605 is a deficient number, since it is larger than the sum of its proper divisors (26428127).
132140605 is an equidigital number, since it uses as much as digits as its factorization.
132140605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26428126.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 132140605 is about 11495.2427116612. The cubic root of 132140605 is about 509.3450582975.
Adding to 132140605 its reverse (506041231), we get a palindrome (638181836).
The spelling of 132140605 in words is "one hundred thirty-two million, one hundred forty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •