Recognised as Number
-32,248
- Negative
- Even
- 5 digits
-32,248 is an even 5-digit integer and the negative of 32,248. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value32,248
Digit count5
Digit sum19
Digit product384
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^3 × 29 × 139
Distinct prime factors32, 29, 139
Number of divisors16
Sum of divisors σ(n)63,000
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 29, 58, 116, 139, 232, 278, 556, 1,112, 4,031, 8,062, 16,124, 32,24816 in total
Arithmetic
Representations
Decimal-32,248
Binary11111011111100015 bits
Octal76770
Hexadecimal7DF8
Base 36OVS
In wordsminus thirty-two thousand, two hundred and forty-eight
Ordinalminus thirty-two thousand, two hundred and forty-eighth
Scientific notation-3.2248 × 10^4
Engineering notation-32.248 × 10^3
In other bases
Ternary1122020101base 3; the most digit-efficient integer base after e: 10 digits
Quinary2012443base 5; one hand: 7 digits
Septenary163006base 7: 6 digits
Nonary48211base 9; each digit is two ternary digits: 5 digits
Duodecimal167b4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal40c8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:57:28base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1101T10T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000011000011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000001000001000
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 even
Highest set bitbit 14worth 16,384
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes27d f8
Gray code100001100000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000001000001000two's complement
32-bit11111111111111111000001000001000two's complement
64-bit1111111111111111111111111111111111111111111111111000001000001000two's complement
One's complement0111110111110111at 16 bits, every bit flipped
Bits reversed0001000001000001at 16 bits
Rotated left by 10000010000010001at 16 bits, wrapping
Shifted left by 1-1111101111110000= -64,496, no wrap
Shifted right by 1-11111011111100= -16,124, discarding the low bit
These bits as a double1.59326289 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,248 to the power 21,039,933,504
-32,248 to the power 3-33,535,775,636,992
-32,248 to the power 41,081,461,692,741,718,016
-32,248 to the power 5-34,874,976,667,534,922,579,968
First ten multiples-32,248, -64,496, -96,744, -128,992, -161,240, -193,488, -225,736, -257,984, -290,232, -322,480
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 48
As a percentage & fraction
As a percentage-3,224,800%
-32,248% as a decimal-322.48
-32,248% of 100-32,248
-32,248% of 1,000-322,480
As a fraction of 100-32,248/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,248
Nerdulate something else
Nothing in mind? Surprise me · today’s page