Base | Representation |
---|---|
bin | 11110001010011110110010… |
… | …110010111010110011010111 |
3 | 122101201022220210122120011112 |
4 | 132022132302302322303113 |
5 | 114342012032032022210 |
6 | 1150051531152325235 |
7 | 36641326320206261 |
oct | 3612366262726327 |
9 | 571638823576145 |
10 | 132661654564055 |
11 | 392a7545579081 |
12 | 12a6687384381b |
13 | 5903c2bc32606 |
14 | 24a8c03400b31 |
15 | 1050c7a022d05 |
hex | 78a7b2cbacd7 |
132661654564055 has 4 divisors (see below), whose sum is σ = 159193985476872. Its totient is φ = 106129323651240.
The previous prime is 132661654564007. The next prime is 132661654564151. The reversal of 132661654564055 is 550465456166231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-132661654564055 is a prime.
It is a super-2 number, since 2×1326616545640552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132661654563985 and 132661654564003.
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, 13266165456401 + ... + 13266165456410.
It is an arithmetic number, because the mean of its divisors is an integer number (39798496369218).
Almost surely, 2132661654564055 is an apocalyptic number.
132661654564055 is a deficient number, since it is larger than the sum of its proper divisors (26532330912817).
132661654564055 is an equidigital number, since it uses as much as digits as its factorization.
132661654564055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26532330912816.
The product of its (nonzero) digits is 77760000, while the sum is 59.
The spelling of 132661654564055 in words is "one hundred thirty-two trillion, six hundred sixty-one billion, six hundred fifty-four million, five hundred sixty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •