Base | Representation |
---|---|
bin | 11110000010111101010010… |
… | …000010011010110010000101 |
3 | 122022212220101211102122000212 |
4 | 132002331102002122302011 |
5 | 114310024203100133413 |
6 | 1145014223552245205 |
7 | 36556064150616065 |
oct | 3602752202326205 |
9 | 568786354378025 |
10 | 132144635161733 |
11 | 391182525aa827 |
12 | 129a2622b40805 |
13 | 5897254a8a09c |
14 | 248bb97acb3a5 |
15 | 10425ba183ca8 |
hex | 782f5209ac85 |
132144635161733 has 2 divisors, whose sum is σ = 132144635161734. Its totient is φ = 132144635161732.
The previous prime is 132144635161577. The next prime is 132144635161783. The reversal of 132144635161733 is 337161536441231.
It is an a-pointer prime, because the next prime (132144635161783) can be obtained adding 132144635161733 to its sum of digits (50).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107665671706849 + 24478963454884 = 10376207^2 + 4947622^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132144635161733 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132144635161783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66072317580866 + 66072317580867.
It is an arithmetic number, because the mean of its divisors is an integer number (66072317580867).
Almost surely, 2132144635161733 is an apocalyptic number.
It is an amenable number.
132144635161733 is a deficient number, since it is larger than the sum of its proper divisors (1).
132144635161733 is an equidigital number, since it uses as much as digits as its factorization.
132144635161733 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3265920, while the sum is 50.
The spelling of 132144635161733 in words is "one hundred thirty-two trillion, one hundred forty-four billion, six hundred thirty-five million, one hundred sixty-one thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •