Base | Representation |
---|---|
bin | 111101100001110100… |
… | …0001110101111000001 |
3 | 110122001110000110120110 |
4 | 1323003220032233001 |
5 | 4131101031401423 |
6 | 140411124301533 |
7 | 12355222002234 |
oct | 1730350165701 |
9 | 418043013513 |
10 | 132131122113 |
11 | 51044634781 |
12 | 217365418a9 |
13 | c5c956b333 |
14 | 657653741b |
15 | 3684ec7193 |
hex | 1ec3a0ebc1 |
132131122113 has 8 divisors (see below), whose sum is σ = 176930945568. Its totient is φ = 87709356704.
The previous prime is 132131122093. The next prime is 132131122129. The reversal of 132131122113 is 311221131231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132131122113 - 221 = 132129024961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132131122113.
It is not an unprimeable number, because it can be changed into a prime (132131122183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94513695 + ... + 94515092.
It is an arithmetic number, because the mean of its divisors is an integer number (22116368196).
Almost surely, 2132131122113 is an apocalyptic number.
It is an amenable number.
132131122113 is a deficient number, since it is larger than the sum of its proper divisors (44799823455).
132131122113 is a wasteful number, since it uses less digits than its factorization.
132131122113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189029023.
The product of its digits is 216, while the sum is 21.
Adding to 132131122113 its reverse (311221131231), we get a palindrome (443352253344).
The spelling of 132131122113 in words is "one hundred thirty-two billion, one hundred thirty-one million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •