Base | Representation |
---|---|
bin | 11110001010101101111111… |
… | …100110101111101000000001 |
3 | 122101202220001020120021120211 |
4 | 132022231333212233220001 |
5 | 114342243443223304323 |
6 | 1150103230501034121 |
7 | 36642444630565261 |
oct | 3612557746575001 |
9 | 571686036507524 |
10 | 132677975603713 |
11 | 39303460358801 |
12 | 12a69a696b5941 |
13 | 5905630372027 |
14 | 24a9910c617a1 |
15 | 10513d2cd170d |
hex | 78ab7f9afa01 |
132677975603713 has 4 divisors (see below), whose sum is σ = 132741488279620. Its totient is φ = 132614462927808.
The previous prime is 132677975603699. The next prime is 132677975603809. The reversal of 132677975603713 is 317306579776231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 120925365512449 + 11752610091264 = 10996607^2 + 3428208^2 .
It is a cyclic number.
It is not a de Polignac number, because 132677975603713 - 225 = 132677942049281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132677975606713) 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, 31756334820 + ... + 31756338997.
It is an arithmetic number, because the mean of its divisors is an integer number (33185372069905).
Almost surely, 2132677975603713 is an apocalyptic number.
It is an amenable number.
132677975603713 is a deficient number, since it is larger than the sum of its proper divisors (63512675907).
132677975603713 is an equidigital number, since it uses as much as digits as its factorization.
132677975603713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63512675906.
The product of its (nonzero) digits is 210039480, while the sum is 67.
The spelling of 132677975603713 in words is "one hundred thirty-two trillion, six hundred seventy-seven billion, nine hundred seventy-five million, six hundred three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •