Base | Representation |
---|---|
bin | 11110001000011111111000… |
… | …001101011110011110110000 |
3 | 122101020022011121101121122110 |
4 | 132020133320031132132300 |
5 | 114332243434312402433 |
6 | 1145505152540005320 |
7 | 36625433315216361 |
oct | 3610377015363660 |
9 | 571208147347573 |
10 | 132525380200368 |
11 | 39254775214711 |
12 | 12a44381830840 |
13 | 58c412219bc5c |
14 | 24a2396907b68 |
15 | 104c45142d963 |
hex | 7887f835e7b0 |
132525380200368 has 160 divisors (see below), whose sum is σ = 360314838374400. Its totient is φ = 41917498675200.
The previous prime is 132525380200349. The next prime is 132525380200429. The reversal of 132525380200368 is 863002083525231.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32210808 + ... + 36091368.
It is an arithmetic number, because the mean of its divisors is an integer number (2251967739840).
Almost surely, 2132525380200368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132525380200368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180157419187200).
132525380200368 is an abundant number, since it is smaller than the sum of its proper divisors (227789458174032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132525380200368 is a wasteful number, since it uses less digits than its factorization.
132525380200368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3881051 (or 3881045 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 132525380200368 in words is "one hundred thirty-two trillion, five hundred twenty-five billion, three hundred eighty million, two hundred thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •