Base | Representation |
---|---|
bin | 111101101101110110… |
… | …1000110011101101111 |
3 | 110200002121002020101221 |
4 | 1323123231012131233 |
5 | 4132412433132033 |
6 | 140515154044211 |
7 | 12401225232634 |
oct | 1733355063557 |
9 | 420077066357 |
10 | 132535052143 |
11 | 5123164434a |
12 | 21829879667 |
13 | c6621576a0 |
14 | 65b404218b |
15 | 36aa6b512d |
hex | 1edbb4676f |
132535052143 has 8 divisors (see below), whose sum is σ = 143256739136. Its totient is φ = 121888605600.
The previous prime is 132535052101. The next prime is 132535052171. The reversal of 132535052143 is 341250535231.
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-132535052143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132535052099 and 132535052108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132535052443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18806448 + ... + 18813493.
It is an arithmetic number, because the mean of its divisors is an integer number (17907092392).
Almost surely, 2132535052143 is an apocalyptic number.
132535052143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132535052143 is a deficient number, since it is larger than the sum of its proper divisors (10721686993).
132535052143 is a wasteful number, since it uses less digits than its factorization.
132535052143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37620225.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 132535052143 its reverse (341250535231), we get a palindrome (473785587374).
The spelling of 132535052143 in words is "one hundred thirty-two billion, five hundred thirty-five million, fifty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •