Base | Representation |
---|---|
bin | 11110001010011001110101… |
… | …100001001010000011100001 |
3 | 122101200211011211102102211022 |
4 | 132022121311201022003201 |
5 | 114341420131332433330 |
6 | 1150045251041255225 |
7 | 36641050363160021 |
oct | 3612316541120341 |
9 | 571624154372738 |
10 | 132656331530465 |
11 | 392a5263895166 |
12 | 12a65829034515 |
13 | 590359119cab2 |
14 | 24a885a491a81 |
15 | 1050a67a5cae5 |
hex | 78a67584a0e1 |
132656331530465 has 8 divisors (see below), whose sum is σ = 159775005948288. Its totient is φ = 105733459816560.
The previous prime is 132656331530449. The next prime is 132656331530467. The reversal of 132656331530465 is 564035133656231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132656331530465 - 24 = 132656331530449 is a prime.
It is a super-3 number, since 3×1326563315304653 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132656331530467) 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, 48950674487 + ... + 48950677196.
It is an arithmetic number, because the mean of its divisors is an integer number (19971875743536).
Almost surely, 2132656331530465 is an apocalyptic number.
It is an amenable number.
132656331530465 is a deficient number, since it is larger than the sum of its proper divisors (27118674417823).
132656331530465 is an equidigital number, since it uses as much as digits as its factorization.
132656331530465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97901351959.
The product of its (nonzero) digits is 17496000, while the sum is 53.
The spelling of 132656331530465 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, three hundred thirty-one million, five hundred thirty thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •