Base | Representation |
---|---|
bin | 111101110000000010… |
… | …1011110010111110001 |
3 | 110200021201101100001001 |
4 | 1323200011132113301 |
5 | 4133040242103020 |
6 | 140530341242001 |
7 | 12403110036343 |
oct | 1734005362761 |
9 | 420251340031 |
10 | 132608550385 |
11 | 5126a0846a3 |
12 | 2184a403301 |
13 | c67444c57c |
14 | 65bdad5293 |
15 | 36b1d8250a |
hex | 1ee015e5f1 |
132608550385 has 4 divisors (see below), whose sum is σ = 159130260468. Its totient is φ = 106086840304.
The previous prime is 132608550359. The next prime is 132608550419. The reversal of 132608550385 is 583055806231.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 583055806231 = 126827 ⋅4597253.
It can be written as a sum of positive squares in 2 ways, for example, as 82842079329 + 49766471056 = 287823^2 + 223084^2 .
It is a cyclic number.
It is not a de Polignac number, because 132608550385 - 27 = 132608550257 is a prime.
It is a super-2 number, since 2×1326085503852 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13260855034 + ... + 13260855043.
It is an arithmetic number, because the mean of its divisors is an integer number (39782565117).
Almost surely, 2132608550385 is an apocalyptic number.
It is an amenable number.
132608550385 is a deficient number, since it is larger than the sum of its proper divisors (26521710083).
132608550385 is an equidigital number, since it uses as much as digits as its factorization.
132608550385 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26521710082.
The product of its (nonzero) digits is 864000, while the sum is 46.
The spelling of 132608550385 in words is "one hundred thirty-two billion, six hundred eight million, five hundred fifty thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •