Base | Representation |
---|---|
bin | 111101101111001101… |
… | …0001001100001011101 |
3 | 110200012202102221100021 |
4 | 1323132122021201131 |
5 | 4133011041244311 |
6 | 140523454232141 |
7 | 12402315636565 |
oct | 1733632114135 |
9 | 420182387307 |
10 | 132580415581 |
11 | 51255208599 |
12 | 21840ab5651 |
13 | c66b67b563 |
14 | 65ba08dda5 |
15 | 36ae676171 |
hex | 1ede68985d |
132580415581 has 4 divisors (see below), whose sum is σ = 132581988000. Its totient is φ = 132578843164.
The previous prime is 132580415579. The next prime is 132580415623. The reversal of 132580415581 is 185514085231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 185514085231 = 1193 ⋅155502167.
It is a cyclic number.
It is not a de Polignac number, because 132580415581 - 21 = 132580415579 is a prime.
It is a super-2 number, since 2×1325804155812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132580445581) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 652111 + ... + 830908.
It is an arithmetic number, because the mean of its divisors is an integer number (33145497000).
Almost surely, 2132580415581 is an apocalyptic number.
It is an amenable number.
132580415581 is a deficient number, since it is larger than the sum of its proper divisors (1572419).
132580415581 is an equidigital number, since it uses as much as digits as its factorization.
132580415581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1572418.
The product of its (nonzero) digits is 192000, while the sum is 43.
The spelling of 132580415581 in words is "one hundred thirty-two billion, five hundred eighty million, four hundred fifteen thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •