Base | Representation |
---|---|
bin | 111101100001001101… |
… | …1111001100000010011 |
3 | 110122000001100212010222 |
4 | 1323002123321200103 |
5 | 4131030421042321 |
6 | 140405131343255 |
7 | 12354556632311 |
oct | 1730233714023 |
9 | 418001325128 |
10 | 132111112211 |
11 | 51034307a71 |
12 | 2172b8b1b2b |
13 | c5c5383560 |
14 | 6573a090b1 |
15 | 36833733ab |
hex | 1ec26f9813 |
132111112211 has 8 divisors (see below), whose sum is σ = 146862973824. Its totient is φ = 118014888960.
The previous prime is 132111112123. The next prime is 132111112219. The reversal of 132111112211 is 112211111231.
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 132111112211 - 234 = 114931243027 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132111112211.
It is not an unprimeable number, because it can be changed into a prime (132111112219) 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, 163909166 + ... + 163909971.
It is an arithmetic number, because the mean of its divisors is an integer number (18357871728).
Almost surely, 2132111112211 is an apocalyptic number.
132111112211 is a deficient number, since it is larger than the sum of its proper divisors (14751861613).
132111112211 is a wasteful number, since it uses less digits than its factorization.
132111112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327819181.
The product of its digits is 24, while the sum is 17.
Adding to 132111112211 its reverse (112211111231), we get a palindrome (244322223442).
The spelling of 132111112211 in words is "one hundred thirty-two billion, one hundred eleven million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •