Base | Representation |
---|---|
bin | 11110000111011110100111… |
… | …011111111010001100110001 |
3 | 122100222121022001112221210011 |
4 | 132013132213133322030301 |
5 | 114330121431442220030 |
6 | 1145413043335334521 |
7 | 36620402655363154 |
oct | 3607364737721461 |
9 | 570877261487704 |
10 | 132455306601265 |
11 | 39227a8652353a |
12 | 12a32886221441 |
13 | 58ba63572584b |
14 | 249cc2a213c9b |
15 | 104a6ee630b2a |
hex | 7877a77fa331 |
132455306601265 has 8 divisors (see below), whose sum is σ = 158968114629480. Its totient is φ = 105949747475712.
The previous prime is 132455306601181. The next prime is 132455306601311. The reversal of 132455306601265 is 562106603554231.
It can be written as a sum of positive squares in 4 ways, for example, as 31608862974976 + 100846443626289 = 5622176^2 + 10042233^2 .
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 132455306601265 - 29 = 132455306600753 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 1812185464 + ... + 1812258553.
It is an arithmetic number, because the mean of its divisors is an integer number (19871014328685).
Almost surely, 2132455306601265 is an apocalyptic number.
It is an amenable number.
132455306601265 is a deficient number, since it is larger than the sum of its proper divisors (26512808028215).
132455306601265 is an equidigital number, since it uses as much as digits as its factorization.
132455306601265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3624451331.
The product of its (nonzero) digits is 3888000, while the sum is 49.
The spelling of 132455306601265 in words is "one hundred thirty-two trillion, four hundred fifty-five billion, three hundred six million, six hundred one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •