Recognised as Number
-132,647
- Negative
- Odd
- 6 digits
-132,647 is an odd 6-digit integer and the negative of 132,647. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value132,647
Digit count6
Digit sum23
Digit product1,008
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 132,647
Distinct prime factors1132,647
Number of divisors2
Sum of divisors σ(n)132,648
SquarefreeYesno repeated prime factor
All divisors1, 132,6472 in total
Arithmetic
Representations
Decimal-132,647
Binary10000001100010011118 bits
Octal403047
Hexadecimal20627
Base 362UCN
In wordsminus one hundred and thirty-two thousand, six hundred and forty-seven
Ordinalminus one hundred and thirty-two thousand, six hundred and forty-seventh
Scientific notation-1.32647 × 10^5
Engineering notation-132.647 × 10^3
In other bases
Ternary20201221212base 3; the most digit-efficient integer base after e: 11 digits
Quinary13221042base 5; one hand: 8 digits
Septenary1061504base 7: 7 digits
Nonary221855base 9; each digit is two ternary digits: 6 digits
Duodecimal6491bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgbc7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:50:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T1001011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111000101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111100111011001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 06 27
Gray code110000010100110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111100111011001two's complement
64-bit1111111111111111111111111111111111111111111111011111100111011001two's complement
One's complement00000000000000100000011000100110at 32 bits, every bit flipped
Bits reversed10011011100111111011111111111111at 32 bits
Rotated left by 111111111111110111111001110110011at 32 bits, wrapping
Shifted left by 1-1000000110001001110= -265,294, no wrap
Shifted right by 1-10000001100010100= -66,323, discarding the low bit
These bits as a double6.55363257 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-132,647 to the power 217,595,226,609
-132,647 to the power 3-2,333,954,024,004,023
-132,647 to the power 4309,591,999,422,061,638,881
-132,647 to the power 5-41,066,449,947,338,210,212,648,007
First ten multiples-132,647, -265,294, -397,941, -530,588, -663,235, -795,882, -928,529, -1,061,176, -1,193,823, -1,326,470
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
As a percentage & fraction
As a percentage-13,264,700%
-132,647% as a decimal-1,326.47
-132,647% of 100-132,647
-132,647% of 1,000-1,326,470
As a fraction of 100-132,647/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -132,647
Nerdulate something else
Nothing in mind? Surprise me · today’s page