Recognised as Number
-32,227
- Negative
- Odd
- 5 digits
-32,227 is an odd 5-digit integer and the negative of 32,227. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value32,227
Digit count5
Digit sum16
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 37 × 67
Distinct prime factors313, 37, 67
Number of divisors8
Sum of divisors σ(n)36,176
SquarefreeYesno repeated prime factor
All divisors1, 13, 37, 67, 481, 871, 2,479, 32,2278 in total
Arithmetic
Representations
Decimal-32,227
Binary11111011110001115 bits
Octal76743
Hexadecimal7DE3
Base 36OV7
In wordsminus thirty-two thousand, two hundred and twenty-seven
Ordinalminus thirty-two thousand, two hundred and twenty-seventh
Scientific notation-3.2227 × 10^4
Engineering notation-32.227 × 10^3
In other bases
Ternary1122012121base 3; the most digit-efficient integer base after e — 10 digits
Quinary2012402base 5; one hand — 7 digits
Septenary162646base 7 — 6 digits
Nonary48177base 9; each digit is two ternary digits — 5 digits
Duodecimal16797base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 5 digits
Vigesimal40b7base 20; hands and feet, and the Mayan and Yoruba systems — 4 digits
Sexagesimal8:57:7base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT1101T1011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000011001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000001000011101
Bit length15 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits4within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27d e3
Gray code100001100010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000001000011101two's complement
32-bit11111111111111111000001000011101two's complement
64-bit1111111111111111111111111111111111111111111111111000001000011101two's complement
One's complement0111110111100010at 16 bits, every bit flipped
Bits reversed1011100001000001at 16 bits
Rotated left by 10000010000111011at 16 bits, wrapping
Shifted left by 1-1111101111000110= -64,454, no wrap
Shifted right by 1-11111011110010= -16,113, discarding the low bit
These bits as a double1.59222536 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,227 to the power 21,038,579,529
-32,227 to the power 3-33,470,302,481,083
-32,227 to the power 41,078,647,438,057,861,841
-32,227 to the power 5-34,761,570,986,290,713,549,907
First ten multiples-32,227, -64,454, -96,681, -128,908, -161,135, -193,362, -225,589, -257,816, -290,043, -322,270
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27
As a percentage & fraction
As a percentage-3,222,700%
-32,227% as a decimal-322.27
-32,227% of 100-32,227
-32,227% of 1,000-322,270
As a fraction of 100-32,227/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,227
Nerdulate something else
Nothing in mind? Surprise me · today’s page