Base | Representation |
---|---|
bin | 11110000011000010110111… |
… | …101000001010010001000001 |
3 | 122022220110212221021200200212 |
4 | 132003002313220022101001 |
5 | 114310123444414143130 |
6 | 1145021055143323505 |
7 | 36556365626420264 |
oct | 3603026750122101 |
9 | 568813787250625 |
10 | 132150634521665 |
11 | 3911a851033731 |
12 | 129a3818150595 |
13 | 589799c9906c6 |
14 | 248c1a67b0cdb |
15 | 104281bbe1e95 |
hex | 7830b7a0a441 |
132150634521665 has 8 divisors (see below), whose sum is σ = 158859462240360. Its totient is φ = 105534707074432.
The previous prime is 132150634521623. The next prime is 132150634521701. The reversal of 132150634521665 is 566125436051231.
It can be written as a sum of positive squares in 4 ways, for example, as 887258499136 + 131263376022529 = 941944^2 + 11457023^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 132150634521665 - 212 = 132150634517569 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23225064734 + ... + 23225070423.
It is an arithmetic number, because the mean of its divisors is an integer number (19857432780045).
Almost surely, 2132150634521665 is an apocalyptic number.
It is an amenable number.
132150634521665 is a deficient number, since it is larger than the sum of its proper divisors (26708827718695).
132150634521665 is an equidigital number, since it uses as much as digits as its factorization.
132150634521665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46450135731.
The product of its (nonzero) digits is 3888000, while the sum is 50.
The spelling of 132150634521665 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred thirty-four million, five hundred twenty-one thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •