Base | Representation |
---|---|
bin | 11110001010011110110010… |
… | …110010111010110111011011 |
3 | 122101201022220210122120112011 |
4 | 132022132302302322313123 |
5 | 114342012032032024230 |
6 | 1150051531152330351 |
7 | 36641326320210112 |
oct | 3612366262726733 |
9 | 571638823576464 |
10 | 132661654564315 |
11 | 392a7545579298 |
12 | 12a668738439b7 |
13 | 5903c2bc32776 |
14 | 24a8c03400c79 |
15 | 1050c7a022e2a |
hex | 78a7b2cbaddb |
132661654564315 has 16 divisors (see below), whose sum is σ = 160358130441792. Its totient is φ = 105353247734784.
The previous prime is 132661654564289. The next prime is 132661654564381. The reversal of 132661654564315 is 513465456166231.
It is a cyclic number.
It is not a de Polignac number, because 132661654564315 - 29 = 132661654563803 is a prime.
It is a super-2 number, since 2×1326616545643152 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132661654564315.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51520387 + ... + 54034003.
It is an arithmetic number, because the mean of its divisors is an integer number (10022383152612).
Almost surely, 2132661654564315 is an apocalyptic number.
132661654564315 is a deficient number, since it is larger than the sum of its proper divisors (27696475877477).
132661654564315 is a wasteful number, since it uses less digits than its factorization.
132661654564315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2590806.
The product of its digits is 46656000, while the sum is 58.
The spelling of 132661654564315 in words is "one hundred thirty-two trillion, six hundred sixty-one billion, six hundred fifty-four million, five hundred sixty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •