Base | Representation |
---|---|
bin | 11110000001110001110101… |
… | …111010011001011100100101 |
3 | 122022121011022121221012112202 |
4 | 132001301311322121130211 |
5 | 114302212304430112021 |
6 | 1144513110103424245 |
7 | 36550165633664501 |
oct | 3601616572313445 |
9 | 568534277835482 |
10 | 132063632660261 |
11 | 39096965821535 |
12 | 1298a997455085 |
13 | 588c716050643 |
14 | 2487cb1b53301 |
15 | 1040428b8ca0b |
hex | 781c75e99725 |
132063632660261 has 8 divisors (see below), whose sum is σ = 132480852749784. Its totient is φ = 131646416442880.
The previous prime is 132063632660203. The next prime is 132063632660291. The reversal of 132063632660261 is 162066236360231.
It can be written as a sum of positive squares in 4 ways, for example, as 18308822612161 + 113754810048100 = 4278881^2 + 10665590^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 132063632660261 - 238 = 131788754753317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132063632660291) 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, 77340641 + ... + 79029753.
It is an arithmetic number, because the mean of its divisors is an integer number (16560106593723).
Almost surely, 2132063632660261 is an apocalyptic number.
It is an amenable number.
132063632660261 is a deficient number, since it is larger than the sum of its proper divisors (417220089523).
132063632660261 is a wasteful number, since it uses less digits than its factorization.
132063632660261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1936071.
The product of its (nonzero) digits is 1679616, while the sum is 47.
The spelling of 132063632660261 in words is "one hundred thirty-two trillion, sixty-three billion, six hundred thirty-two million, six hundred sixty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •