Base | Representation |
---|---|
bin | 1111101111111… |
… | …01111011111101 |
3 | 100012120222202200 |
4 | 13313331323331 |
5 | 232310042000 |
6 | 21035342113 |
7 | 3162635355 |
oct | 767757375 |
9 | 305528680 |
10 | 132112125 |
11 | 68634882 |
12 | 382b1939 |
13 | 214a7c72 |
14 | 1378db65 |
15 | b8e9500 |
hex | 7dfdefd |
132112125 has 48 divisors (see below), whose sum is σ = 243781824. Its totient is φ = 68796000.
The previous prime is 132112091. The next prime is 132112147. The reversal of 132112125 is 521211231.
It is not a de Polignac number, because 132112125 - 26 = 132112061 is a prime.
It is a super-2 number, since 2×1321121252 = 34907227144031250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132112098 and 132112107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 47010 + ... + 49740.
It is an arithmetic number, because the mean of its divisors is an integer number (5078788).
Almost surely, 2132112125 is an apocalyptic number.
132112125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132112125 is a deficient number, since it is larger than the sum of its proper divisors (111669699).
132112125 is a wasteful number, since it uses less digits than its factorization.
132112125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2795 (or 2782 counting only the distinct ones).
The product of its digits is 120, while the sum is 18.
The square root of 132112125 is about 11494.0038715845. The cubic root of 132112125 is about 509.3084629614.
Adding to 132112125 its reverse (521211231), we get a palindrome (653323356).
The spelling of 132112125 in words is "one hundred thirty-two million, one hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •