Recognised as Number
-61,091
- Negative
- Odd
- 5 digits
-61,091 is an odd 5-digit integer and the negative of 61,091. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value61,091
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 × 61,091
Distinct prime factors161,091
Number of divisors2
Sum of divisors σ(n)61,092
SquarefreeYesno repeated prime factor
All divisors1, 61,0912 in total
Arithmetic
Representations
Decimal-61,091
Binary111011101010001116 bits
Octal167243
HexadecimalEEA3
Base 361B4Z
In wordsminus sixty-one thousand and ninety-one
Ordinalminus sixty-one thousand and ninety-first
Scientific notation-6.1091 × 10^4
Engineering notation-61.091 × 10^3
In other bases
Ternary10002210122base 3; the most digit-efficient integer base after e: 11 digits
Quinary3423331base 5; one hand: 7 digits
Septenary343052base 7: 6 digits
Nonary102718base 9; each digit is two ternary digits: 6 digits
Duodecimal2b42bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7cebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:58:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00T01TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110001011010101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110001000101011101
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2ee a3
Gray code1001100111110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110001000101011101two's complement
64-bit1111111111111111111111111111111111111111111111110001000101011101two's complement
One's complement00000000000000001110111010100010at 32 bits, every bit flipped
Bits reversed10111010100010001111111111111111at 32 bits
Rotated left by 111111111111111100010001010111011at 32 bits, wrapping
Shifted left by 1-11101110101000110= -122,182, no wrap
Shifted right by 1-111011101010010= -30,545, discarding the low bit
These bits as a double3.01829644 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-61,091 to the power 23,732,110,281
-61,091 to the power 3-227,998,349,176,571
-61,091 to the power 413,928,647,149,545,898,961
-61,091 to the power 5-850,914,983,012,908,513,426,451
First ten multiples-61,091, -122,182, -183,273, -244,364, -305,455, -366,546, -427,637, -488,728, -549,819, -610,910
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-6,109,100%
-61,091% as a decimal-610.91
-61,091% of 100-61,091
-61,091% of 1,000-610,910
As a fraction of 100-61,091/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -61,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page