Recognised as Number
-132,651
- Negative
- Odd
- Perfect cube
- 6 digits
-132,651 is an odd 6-digit integer and the negative of 132,651. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value132,651
Digit count6
Digit sum18
Digit product180
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -51³
Factors & divisors
Prime factorisation−1 × 3^3 × 17^3
Distinct prime factors23, 17
Number of divisors16
Sum of divisors σ(n)208,800
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 27, 51, 153, 289, 459, 867, 2,601, 4,913, 7,803, 14,739, 44,217, 132,65116 in total
Arithmetic
Representations
Decimal-132,651
Binary10000001100010101118 bits
Octal403053
Hexadecimal2062B
Base 362UCR
In wordsminus one hundred and thirty-two thousand, six hundred and fifty-one
Ordinalminus one hundred and thirty-two thousand, six hundred and fifty-first
Scientific notation-1.32651 × 10^5
Engineering notation-132.651 × 10^3
In other bases
Ternary20201222000base 3; the most digit-efficient integer base after e: 11 digits
Quinary13221101base 5; one hand: 8 digits
Septenary1061511base 7: 7 digits
Nonary221860base 9; each digit is two ternary digits: 6 digits
Duodecimal64923base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgbcbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:50:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T1001000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111011010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111100111010101
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 2b
Gray code110000010100111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111100111010101two's complement
64-bit1111111111111111111111111111111111111111111111011111100111010101two's complement
One's complement00000000000000100000011000101010at 32 bits, every bit flipped
Bits reversed10101011100111111011111111111111at 32 bits
Rotated left by 111111111111110111111001110101011at 32 bits, wrapping
Shifted left by 1-1000000110001010110= -265,302, no wrap
Shifted right by 1-10000001100010110= -66,325, discarding the low bit
These bits as a double6.5538302 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-132,651 to the power 217,596,287,801
-132,651 to the power 3-2,334,165,173,090,451
-132,651 to the power 4309,629,344,375,621,415,601
-132,651 to the power 5-41,072,642,160,770,556,400,888,251
First ten multiples-132,651, -265,302, -397,953, -530,604, -663,255, -795,906, -928,557, -1,061,208, -1,193,859, -1,326,510
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-13,265,100%
-132,651% as a decimal-1,326.51
-132,651% of 100-132,651
-132,651% of 1,000-1,326,510
As a fraction of 100-132,651/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -132,651
Nerdulate something else
Nothing in mind? Surprise me · today’s page