Base | Representation |
---|---|
bin | 111101100010000110… |
… | …1111101010010001111 |
3 | 110122002010121221002200 |
4 | 1323010031331102033 |
5 | 4131111044341421 |
6 | 140412120252543 |
7 | 12355402033113 |
oct | 1730415752217 |
9 | 418063557080 |
10 | 132141012111 |
11 | 5104a17a229 |
12 | 21739911153 |
13 | c5cb621ac4 |
14 | 657798d743 |
15 | 3685ccc726 |
hex | 1ec437d48f |
132141012111 has 12 divisors (see below), whose sum is σ = 191288016192. Its totient is φ = 87901239456.
The previous prime is 132141012077. The next prime is 132141012119. The reversal of 132141012111 is 111210141231.
132141012111 is a `hidden beast` number, since 132 + 1 + 410 + 12 + 111 = 666.
It is not a de Polignac number, because 132141012111 - 29 = 132141011599 is a prime.
It is a super-2 number, since 2×1321410121112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132141012119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16059711 + ... + 16067936.
It is an arithmetic number, because the mean of its divisors is an integer number (15940668016).
Almost surely, 2132141012111 is an apocalyptic number.
132141012111 is a deficient number, since it is larger than the sum of its proper divisors (59147004081).
132141012111 is a wasteful number, since it uses less digits than its factorization.
132141012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32128110 (or 32128107 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 132141012111 its reverse (111210141231), we get a palindrome (243351153342).
The spelling of 132141012111 in words is "one hundred thirty-two billion, one hundred forty-one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •