Recognised as Number
-15,751
- Negative
- Odd
- 5 digits
-15,751 is an odd 5-digit integer and the negative of 15,751. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value15,751
Digit count5
Digit sum19
Digit product175
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicYesreads the same backwards
Factors & divisors
Prime factorisation−1 × 19 × 829
Distinct prime factors219, 829
Number of divisors4
Sum of divisors σ(n)16,600
SquarefreeYesno repeated prime factor
All divisors1, 19, 829, 15,7514 in total
Arithmetic
Representations
Decimal-15,751
Binary1111011000011114 bits
Octal36607
Hexadecimal3D87
Base 36C5J
In wordsminus fifteen thousand, seven hundred and fifty-one
Ordinalminus fifteen thousand, seven hundred and fifty-first
Scientific notation-1.5751 × 10^4
Engineering notation-15.751 × 10^3
In other bases
Ternary210121101base 3; the most digit-efficient integer base after e: 9 digits
Quinary1001001base 5; one hand: 7 digits
Septenary63631base 7: 5 digits
Nonary23541base 9; each digit is two ternary digits: 5 digits
Duodecimal9147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1j7bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:22:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TT11TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011110001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100001001111001
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes23d 87
Gray code10001101000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100001001111001two's complement
32-bit11111111111111111100001001111001two's complement
64-bit1111111111111111111111111111111111111111111111111100001001111001two's complement
One's complement0011110110000110at 16 bits, every bit flipped
Bits reversed1001111001000011at 16 bits
Rotated left by 11000010011110011at 16 bits, wrapping
Shifted left by 1-111101100001110= -31,502, no wrap
Shifted right by 1-1111011000100= -7,875, discarding the low bit
These bits as a double7.78202799 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-15,751 to the power 2248,094,001
-15,751 to the power 3-3,907,728,609,751
-15,751 to the power 461,550,633,332,188,001
-15,751 to the power 5-969,484,025,615,293,203,751
First ten multiples-15,751, -31,502, -47,253, -63,004, -78,755, -94,506, -110,257, -126,008, -141,759, -157,510
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-1,575,100%
-15,751% as a decimal-157.51
-15,751% of 100-15,751
-15,751% of 1,000-157,510
As a fraction of 100-15,751/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -15,751
Nerdulate something else
Nothing in mind? Surprise me · today’s page