Base | Representation |
---|---|
bin | 11110000001101110111101… |
… | …010010110000110110111101 |
3 | 122022120212022202122002210211 |
4 | 132001232331102300312331 |
5 | 114302134434011401103 |
6 | 1144511434455432421 |
7 | 36550026113355664 |
oct | 3601567522606675 |
9 | 568525282562724 |
10 | 132060535262653 |
11 | 390956163878a8 |
12 | 1298a272085711 |
13 | 588c341426caa |
14 | 2487a9a635ddb |
15 | 10402e6caa36d |
hex | 781bbd4b0dbd |
132060535262653 has 2 divisors, whose sum is σ = 132060535262654. Its totient is φ = 132060535262652.
The previous prime is 132060535262627. The next prime is 132060535262683. The reversal of 132060535262653 is 356262535060231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104552220106084 + 27508315156569 = 10225078^2 + 5244837^2 .
It is a cyclic number.
It is not a de Polignac number, because 132060535262653 - 29 = 132060535262141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132060535262597 and 132060535262606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132060535262603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66030267631326 + 66030267631327.
It is an arithmetic number, because the mean of its divisors is an integer number (66030267631327).
Almost surely, 2132060535262653 is an apocalyptic number.
It is an amenable number.
132060535262653 is a deficient number, since it is larger than the sum of its proper divisors (1).
132060535262653 is an equidigital number, since it uses as much as digits as its factorization.
132060535262653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832000, while the sum is 49.
The spelling of 132060535262653 in words is "one hundred thirty-two trillion, sixty billion, five hundred thirty-five million, two hundred sixty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •