Base | Representation |
---|---|
bin | 11110001010011001110101… |
… | …100001011011011011100001 |
3 | 122101200211011211120001110011 |
4 | 132022121311201123123201 |
5 | 114341420131342223013 |
6 | 1150045251043004521 |
7 | 36641050363604350 |
oct | 3612316541333341 |
9 | 571624154501404 |
10 | 132656331601633 |
11 | 392a5263933684 |
12 | 12a65829069741 |
13 | 59035911c62c8 |
14 | 24a885a4ad997 |
15 | 1050a67a73c3d |
hex | 78a67585b6e1 |
132656331601633 has 8 divisors (see below), whose sum is σ = 154467750005568. Its totient is φ = 111560041670064.
The previous prime is 132656331601627. The next prime is 132656331601753. The reversal of 132656331601633 is 336106133656231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132656331601633 - 229 = 132655794730721 is a prime.
It is a super-3 number, since 3×1326563316016333 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132656331611633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178782117691 + ... + 178782118432.
It is an arithmetic number, because the mean of its divisors is an integer number (19308468750696).
Almost surely, 2132656331601633 is an apocalyptic number.
It is an amenable number.
132656331601633 is a deficient number, since it is larger than the sum of its proper divisors (21811418403935).
132656331601633 is an equidigital number, since it uses as much as digits as its factorization.
132656331601633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357564236183.
The product of its (nonzero) digits is 3149280, while the sum is 49.
The spelling of 132656331601633 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, three hundred thirty-one million, six hundred one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •