Recognised as Number
-3,461
- Negative
- Odd
- 4 digits
-3,461 is an odd 4-digit integer and the negative of 3,461. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,461
Digit count4
Digit sum14
Digit product72
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,461
Distinct prime factors13,461
Number of divisors2
Sum of divisors σ(n)3,462
SquarefreeYesno repeated prime factor
All divisors1, 3,4612 in total
Arithmetic
Previous number-3,462
Next number-3,460
Double-6,922
Half-1,730.5
Square11,978,521
Cube-41,457,661,181
Cube root-15.126340295≈
Negation3,461
Reciprocal-0.0002889338≈
Representations
Decimal-3,461
Binary11011000010112 bits
Octal6605
HexadecimalD85
Base 362O5
In wordsminus three thousand, four hundred and sixty-one
Ordinalminus three thousand, four hundred and sixty-first
Scientific notation-3.461 × 10^3
Engineering notation-3.461 × 10^3
In other bases
Ternary11202012base 3; the most digit-efficient integer base after e: 8 digits
Quinary102321base 5; one hand: 6 digits
Septenary13043base 7: 5 digits
Nonary4665base 9; each digit is two ternary digits: 4 digits
Duodecimal2005base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal8d1base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal57:41base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT111T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001001111011
Bit length12 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits6within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20d 85
Gray code101101000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001001111011two's complement
32-bit11111111111111111111001001111011two's complement
64-bit1111111111111111111111111111111111111111111111111111001001111011two's complement
One's complement0000110110000100at 16 bits, every bit flipped
Bits reversed1101111001001111at 16 bits
Rotated left by 11110010011110111at 16 bits, wrapping
Shifted left by 1-1101100001010= -6,922, no wrap
Shifted right by 1-11011000011= -1,730, discarding the low bit
These bits as a double1.7099612 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,461 to the power 211,978,521
-3,461 to the power 3-41,457,661,181
-3,461 to the power 4143,484,965,347,441
-3,461 to the power 5-496,601,465,067,493,301
First ten multiples-3,461, -6,922, -10,383, -13,844, -17,305, -20,766, -24,227, -27,688, -31,149, -34,610
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-346,100%
-3,461% as a decimal-34.61
-3,461% of 100-3,461
-3,461% of 1,000-34,610
As a fraction of 100-3,461/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,461
Nerdulate something else
Nothing in mind? Surprise me · today’s page