Recognised as Number
-10,592
- Negative
- Even
- 5 digits
-10,592 is an even 5-digit integer and the negative of 10,592. It has 12 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value10,592
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^5 × 331
Distinct prime factors22, 331
Number of divisors12
Sum of divisors σ(n)20,916
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 331, 662, 1,324, 2,648, 5,296, 10,59212 in total
Arithmetic
Representations
Decimal-10,592
Binary1010010110000014 bits
Octal24540
Hexadecimal2960
Base 36868
In wordsminus ten thousand, five hundred and ninety-two
Ordinalminus ten thousand, five hundred and ninety-second
Scientific notation-1.0592 × 10^4
Engineering notation-10.592 × 10^3
In other bases
Ternary112112022base 3; the most digit-efficient integer base after e — 9 digits
Quinary314332base 5; one hand — 6 digits
Septenary42611base 7 — 5 digits
Nonary15468base 9; each digit is two ternary digits — 5 digits
Duodecimal6168base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 4 digits
Vigesimal169cbase 20; hands and feet, and the Mayan and Yoruba systems — 4 digits
Sexagesimal2:56:32base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT110111T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101111100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101011010100000
Bit length14 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits9within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes229 60
Gray code11110111010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101011010100000two's complement
32-bit11111111111111111101011010100000two's complement
64-bit1111111111111111111111111111111111111111111111111101011010100000two's complement
One's complement0010100101011111at 16 bits, every bit flipped
Bits reversed0000010101101011at 16 bits
Rotated left by 11010110101000001at 16 bits, wrapping
Shifted left by 1-101001011000000= -21,184, no wrap
Shifted right by 1-1010010110000= -5,296, discarding the low bit
These bits as a double5.23314332 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10,592 to the power 2112,190,464
-10,592 to the power 3-1,188,321,394,688
-10,592 to the power 412,586,700,212,535,296
-10,592 to the power 5-133,318,328,651,173,855,232
First ten multiples-10,592, -21,184, -31,776, -42,368, -52,960, -63,552, -74,144, -84,736, -95,328, -105,920
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
As a percentage & fraction
As a percentage-1,059,200%
-10,592% as a decimal-105.92
-10,592% of 100-10,592
-10,592% of 1,000-105,920
As a fraction of 100-10,592/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10,592
Nerdulate something else
Nothing in mind? Surprise me · today’s page