Base | Representation |
---|---|
bin | 11110001000110010100100… |
… | …110001001110001011100101 |
3 | 122101022012222122220020212001 |
4 | 132020302210301032023211 |
5 | 114333111043002334000 |
6 | 1145522312543125301 |
7 | 36630043640223214 |
oct | 3610624461161345 |
9 | 571265878806761 |
10 | 132545455121125 |
11 | 39262236a65812 |
12 | 12a482448a3831 |
13 | 58c5ca12490a7 |
14 | 24a333cb3307b |
15 | 104cc28a4846a |
hex | 788ca4c4e2e5 |
132545455121125 has 8 divisors (see below), whose sum is σ = 165416727991320. Its totient is φ = 106036364096800.
The previous prime is 132545455121081. The next prime is 132545455121201. The reversal of 132545455121125 is 521121554545231.
It can be written as a sum of positive squares in 4 ways, for example, as 1763496353089 + 130781958768036 = 1327967^2 + 11435994^2 .
It is not a de Polignac number, because 132545455121125 - 245 = 97361083032293 is a prime.
It is a super-2 number, since 2×1325454551211252 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 530181820360 + ... + 530181820609.
It is an arithmetic number, because the mean of its divisors is an integer number (20677090998915).
Almost surely, 2132545455121125 is an apocalyptic number.
It is an amenable number.
132545455121125 is a deficient number, since it is larger than the sum of its proper divisors (32871272870195).
132545455121125 is an equidigital number, since it uses as much as digits as its factorization.
132545455121125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1060363640984 (or 1060363640974 counting only the distinct ones).
The product of its digits is 1200000, while the sum is 46.
The spelling of 132545455121125 in words is "one hundred thirty-two trillion, five hundred forty-five billion, four hundred fifty-five million, one hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •