Base | Representation |
---|---|
bin | 11110001000101111111011… |
… | …010101101101111100000001 |
3 | 122101021221122120010021100001 |
4 | 132020233323111231330001 |
5 | 114333034232303433130 |
6 | 1145521122521200001 |
7 | 36626613332656645 |
oct | 3610577325557401 |
9 | 571257576107301 |
10 | 132542612561665 |
11 | 39261008459819 |
12 | 12a47790930001 |
13 | 58c593a36a347 |
14 | 24a314d3d0c25 |
15 | 104cb0e2036ca |
hex | 788bfb56df01 |
132542612561665 has 8 divisors (see below), whose sum is σ = 159100028771688. Its totient is φ = 106001494250880.
The previous prime is 132542612561663. The next prime is 132542612561687. The reversal of 132542612561665 is 566165216245231.
It can be written as a sum of positive squares in 4 ways, for example, as 62190241994241 + 70352370567424 = 7886079^2 + 8387632^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132542612561665 - 21 = 132542612561663 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132542612561663) 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, 4074456916 + ... + 4074489445.
It is an arithmetic number, because the mean of its divisors is an integer number (19887503596461).
Almost surely, 2132542612561665 is an apocalyptic number.
It is an amenable number.
132542612561665 is a deficient number, since it is larger than the sum of its proper divisors (26557416210023).
132542612561665 is an equidigital number, since it uses as much as digits as its factorization.
132542612561665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8148949619.
The product of its digits is 15552000, while the sum is 55.
The spelling of 132542612561665 in words is "one hundred thirty-two trillion, five hundred forty-two billion, six hundred twelve million, five hundred sixty-one thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •