Base | Representation |
---|---|
bin | 11110001010011110101001… |
… | …101111011101110110000001 |
3 | 122101201022112012211020112222 |
4 | 132022132221233131312001 |
5 | 114342011224140222230 |
6 | 1150051504124500425 |
7 | 36641322464114204 |
oct | 3612365157356601 |
9 | 571638465736488 |
10 | 132661502664065 |
11 | 392a74778593a1 |
12 | 12a668309aa715 |
13 | 5903c0661996b |
14 | 24a8bcb17d93b |
15 | 1050c6ba1a6e5 |
hex | 78a7a9bddd81 |
132661502664065 has 8 divisors (see below), whose sum is σ = 159561456324648. Its totient is φ = 105884100046080.
The previous prime is 132661502664037. The next prime is 132661502664083. The reversal of 132661502664065 is 560466205166231.
It can be written as a sum of positive squares in 4 ways, for example, as 9277037747329 + 123384464916736 = 3045823^2 + 11107856^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132661502664065 - 224 = 132661485886849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132661502663998 and 132661502664016.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30637758266 + ... + 30637762595.
It is an arithmetic number, because the mean of its divisors is an integer number (19945182040581).
Almost surely, 2132661502664065 is an apocalyptic number.
It is an amenable number.
132661502664065 is a deficient number, since it is larger than the sum of its proper divisors (26899953660583).
132661502664065 is an equidigital number, since it uses as much as digits as its factorization.
132661502664065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61275521299.
The product of its (nonzero) digits is 9331200, while the sum is 53.
The spelling of 132661502664065 in words is "one hundred thirty-two trillion, six hundred sixty-one billion, five hundred two million, six hundred sixty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •