Base | Representation |
---|---|
bin | 111101101011000001… |
… | …0111011100000000111 |
3 | 110122211222102201210102 |
4 | 1323112002323200013 |
5 | 4132214132023421 |
6 | 140501523114315 |
7 | 12365663240630 |
oct | 1732602734007 |
9 | 418758381712 |
10 | 132440111111 |
11 | 51192a98790 |
12 | 21801b1299b |
13 | c648595769 |
14 | 65a55aa887 |
15 | 36a21ae60b |
hex | 1ed60bb807 |
132440111111 has 8 divisors (see below), whose sum is σ = 165120138624. Its totient is φ = 103200086520.
The previous prime is 132440111009. The next prime is 132440111117. The reversal of 132440111111 is 111111044231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132440111111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132440111117) 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, 860000645 + ... + 860000798.
It is an arithmetic number, because the mean of its divisors is an integer number (20640017328).
Almost surely, 2132440111111 is an apocalyptic number.
132440111111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132440111111 is a deficient number, since it is larger than the sum of its proper divisors (32680027513).
132440111111 is a wasteful number, since it uses less digits than its factorization.
132440111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1720001461.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 132440111111 its reverse (111111044231), we get a palindrome (243551155342).
The spelling of 132440111111 in words is "one hundred thirty-two billion, four hundred forty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •