Base | Representation |
---|---|
bin | 111101100001000000… |
… | …1010100001010110111 |
3 | 110121222120020210221011 |
4 | 1323002001110022313 |
5 | 4131022130043133 |
6 | 140404322133051 |
7 | 12354443456431 |
oct | 1730201241267 |
9 | 417876223834 |
10 | 132104143543 |
11 | 51030388339 |
12 | 217294b1187 |
13 | c5c3ab3698 |
14 | 6572b13651 |
15 | 36829486cd |
hex | 1ec20542b7 |
132104143543 has 4 divisors (see below), whose sum is σ = 132142627648. Its totient is φ = 132065659440.
The previous prime is 132104143537. The next prime is 132104143553. The reversal of 132104143543 is 345341401231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 345341401231 = 31 ⋅11140045201.
It is a cyclic number.
It is not a de Polignac number, because 132104143543 - 25 = 132104143511 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132104143553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19236903 + ... + 19243768.
It is an arithmetic number, because the mean of its divisors is an integer number (33035656912).
Almost surely, 2132104143543 is an apocalyptic number.
132104143543 is a deficient number, since it is larger than the sum of its proper divisors (38484105).
132104143543 is an equidigital number, since it uses as much as digits as its factorization.
132104143543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38484104.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 132104143543 its reverse (345341401231), we get a palindrome (477445544774).
The spelling of 132104143543 in words is "one hundred thirty-two billion, one hundred four million, one hundred forty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •