Base | Representation |
---|---|
bin | 11110001001111111100110… |
… | …010001111100111111100111 |
3 | 122101121010110102002020111111 |
4 | 132021333212101330333213 |
5 | 114340434432100133033 |
6 | 1150024311313445451 |
7 | 36636032260205014 |
oct | 3611774621747747 |
9 | 571533412066444 |
10 | 132628158599143 |
11 | 39294316a13949 |
12 | 12a60285b70887 |
13 | 5900a214b472c |
14 | 24a734696870b |
15 | 104ee695377cd |
hex | 789fe647cfe7 |
132628158599143 has 4 divisors (see below), whose sum is σ = 132634547567280. Its totient is φ = 132621769631008.
The previous prime is 132628158599087. The next prime is 132628158599197. The reversal of 132628158599143 is 341995851826231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132628158599143 - 225 = 132628125044711 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 (132628158599243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3194452930 + ... + 3194494447.
It is an arithmetic number, because the mean of its divisors is an integer number (33158636891820).
Almost surely, 2132628158599143 is an apocalyptic number.
132628158599143 is a deficient number, since it is larger than the sum of its proper divisors (6388968137).
132628158599143 is an equidigital number, since it uses as much as digits as its factorization.
132628158599143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6388968136.
The product of its digits is 111974400, while the sum is 67.
The spelling of 132628158599143 in words is "one hundred thirty-two trillion, six hundred twenty-eight billion, one hundred fifty-eight million, five hundred ninety-nine thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •