Base | Representation |
---|---|
bin | 111101110000111100… |
… | …0100101110001110001 |
3 | 110200100211011110221212 |
4 | 1323201320211301301 |
5 | 4133121003233111 |
6 | 140533340125505 |
7 | 12403624402544 |
oct | 1734170456161 |
9 | 420324143855 |
10 | 132638727281 |
11 | 51285115a85 |
12 | 21858536895 |
13 | c67a786c18 |
14 | 65c3b0c85b |
15 | 36b484398b |
hex | 1ee1e25c71 |
132638727281 has 4 divisors (see below), whose sum is σ = 132690888192. Its totient is φ = 132586566372.
The previous prime is 132638727259. The next prime is 132638727317. The reversal of 132638727281 is 182727836231.
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: 182727836231 = 439 ⋅416236529.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132638727281 is a prime.
It is a super-2 number, since 2×1326387272812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132638027281) 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, 26076641 + ... + 26081726.
It is an arithmetic number, because the mean of its divisors is an integer number (33172722048).
Almost surely, 2132638727281 is an apocalyptic number.
It is an amenable number.
132638727281 is a deficient number, since it is larger than the sum of its proper divisors (52160911).
132638727281 is an equidigital number, since it uses as much as digits as its factorization.
132638727281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52160910.
The product of its digits is 1354752, while the sum is 50.
The spelling of 132638727281 in words is "one hundred thirty-two billion, six hundred thirty-eight million, seven hundred twenty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •