Base | Representation |
---|---|
bin | 11110000001000100100110… |
… | …010101110101011000101101 |
3 | 122022102111221000210112211200 |
4 | 132001010212111311120231 |
5 | 114300413312034110203 |
6 | 1144434513401440113 |
7 | 36543526036664226 |
oct | 3601044625653055 |
9 | 568374830715750 |
10 | 132015053035053 |
11 | 390782a68a4051 |
12 | 1298149a1a0039 |
13 | 5887c73644296 |
14 | 24857c3d1a24d |
15 | 103e033d649a3 |
hex | 78112657562d |
132015053035053 has 24 divisors (see below), whose sum is σ = 190941737715456. Its totient is φ = 87893118187200.
The previous prime is 132015053035043. The next prime is 132015053035057. The reversal of 132015053035053 is 350530350510231.
132015053035053 is a `hidden beast` number, since 1 + 3 + 20 + 1 + 5 + 0 + 530 + 3 + 50 + 53 = 666.
It is not a de Polignac number, because 132015053035053 - 28 = 132015053034797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132015053034999 and 132015053035017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132015053035057) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 924591558 + ... + 924734328.
It is an arithmetic number, because the mean of its divisors is an integer number (7955905738144).
Almost surely, 2132015053035053 is an apocalyptic number.
It is an amenable number.
132015053035053 is a deficient number, since it is larger than the sum of its proper divisors (58926684680403).
132015053035053 is a wasteful number, since it uses less digits than its factorization.
132015053035053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278545 (or 278542 counting only the distinct ones).
The product of its (nonzero) digits is 101250, while the sum is 36.
The spelling of 132015053035053 in words is "one hundred thirty-two trillion, fifteen billion, fifty-three million, thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •