Base | Representation |
---|---|
bin | 1111110011011… |
… | …00100010000101 |
3 | 100020110000011110 |
4 | 13321230202011 |
5 | 232414041000 |
6 | 21053155233 |
7 | 3166533150 |
oct | 771544205 |
9 | 306400143 |
10 | 132565125 |
11 | 68914160 |
12 | 3848bb19 |
13 | 21606204 |
14 | 1386ac97 |
15 | b988850 |
hex | 7e6c885 |
132565125 has 64 divisors (see below), whose sum is σ = 275079168. Its totient is φ = 55080000.
The previous prime is 132565093. The next prime is 132565141. The reversal of 132565125 is 521565231.
It is a happy number.
It is not a de Polignac number, because 132565125 - 25 = 132565093 is a prime.
It is a Curzon number.
It is a nialpdrome in base 15.
It is a junction number, because it is equal to n+sod(n) for n = 132565092 and 132565101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26580 + ... + 31170.
It is an arithmetic number, because the mean of its divisors is an integer number (4298112).
Almost surely, 2132565125 is an apocalyptic number.
132565125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132565125 is an abundant number, since it is smaller than the sum of its proper divisors (142514043).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132565125 is a wasteful number, since it uses less digits than its factorization.
132565125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4627 (or 4617 counting only the distinct ones).
The product of its digits is 9000, while the sum is 30.
The square root of 132565125 is about 11513.6929349362. The cubic root of 132565125 is about 509.8899224173.
It can be divided in two parts, 13256 and 5125, that added together give a palindrome (18381).
The spelling of 132565125 in words is "one hundred thirty-two million, five hundred sixty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •