Base | Representation |
---|---|
bin | 11110001010011001111111… |
… | …101101111111000100011111 |
3 | 122101200211121202102222222001 |
4 | 132022121333231333010133 |
5 | 114341421004140244003 |
6 | 1150045320033303131 |
7 | 36641054541614005 |
oct | 3612317755770437 |
9 | 571624552388861 |
10 | 132656502665503 |
11 | 392a5341452483 |
12 | 12a65876404aa7 |
13 | 59035ba78b92b |
14 | 24a88750bca75 |
15 | 1050a77ab461d |
hex | 78a67fb7f11f |
132656502665503 has 4 divisors (see below), whose sum is σ = 134524904111568. Its totient is φ = 130788101219440.
The previous prime is 132656502665399. The next prime is 132656502665543. The reversal of 132656502665503 is 305566205656231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132656502665503 - 213 = 132656502657311 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 (132656502665543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 934200722926 + ... + 934200723067.
It is an arithmetic number, because the mean of its divisors is an integer number (33631226027892).
Almost surely, 2132656502665503 is an apocalyptic number.
132656502665503 is a deficient number, since it is larger than the sum of its proper divisors (1868401446065).
132656502665503 is an equidigital number, since it uses as much as digits as its factorization.
132656502665503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1868401446064.
The product of its (nonzero) digits is 29160000, while the sum is 55.
The spelling of 132656502665503 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, five hundred two million, six hundred sixty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •