Recognised as Number
-5,955
- Negative
- Odd
- 4 digits
-5,955 is an odd 4-digit integer and the negative of 5,955. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value5,955
Digit count4
Digit sum24
Digit product1,125
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5 × 397
Distinct prime factors33, 5, 397
Number of divisors8
Sum of divisors σ(n)9,552
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 397, 1,191, 1,985, 5,9558 in total
Arithmetic
Previous number-5,956
Next number-5,954
Double-11,910
Half-2,977.5
Square35,462,025
Cube-211,176,358,875
Cube root-18.125663868≈
Negation5,955
Reciprocal-0.0001679261≈
Representations
Decimal-5,955
Binary101110100001113 bits
Octal13503
Hexadecimal1743
Base 364LF
In wordsminus five thousand, nine hundred and fifty-five
Ordinalminus five thousand, nine hundred and fifty-fifth
Scientific notation-5.955 × 10^3
Engineering notation-5.955 × 10^3
In other bases
Ternary22011120base 3; the most digit-efficient integer base after e: 8 digits
Quinary142310base 5; one hand: 6 digits
Septenary23235base 7: 5 digits
Nonary8146base 9; each digit is two ternary digits: 4 digits
Duodecimal3543base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalehfbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:39:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T11110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100111001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100010111101
Bit length13 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits6within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes217 43
Gray code1110011100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100010111101two's complement
32-bit11111111111111111110100010111101two's complement
64-bit1111111111111111111111111111111111111111111111111110100010111101two's complement
One's complement0001011101000010at 16 bits, every bit flipped
Bits reversed1011110100010111at 16 bits
Rotated left by 11101000101111011at 16 bits, wrapping
Shifted left by 1-10111010000110= -11,910, no wrap
Shifted right by 1-101110100010= -2,977, discarding the low bit
These bits as a double2.94216092 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-5,955 to the power 235,462,025
-5,955 to the power 3-211,176,358,875
-5,955 to the power 41,257,555,217,100,625
-5,955 to the power 5-7,488,741,317,834,221,875
First ten multiples-5,955, -11,910, -17,865, -23,820, -29,775, -35,730, -41,685, -47,640, -53,595, -59,550
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 55
As a percentage & fraction
As a percentage-595,500%
-5,955% as a decimal-59.55
-5,955% of 100-5,955
-5,955% of 1,000-59,550
As a fraction of 100-5,955/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -5,955
Nerdulate something else
Nothing in mind? Surprise me · today’s page