Recognised as Number
-3,413
- Negative
- Odd
- 4 digits
-3,413 is an odd 4-digit integer and the negative of 3,413. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,413
Digit count4
Digit sum11
Digit product36
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,413
Distinct prime factors13,413
Number of divisors2
Sum of divisors σ(n)3,414
SquarefreeYesno repeated prime factor
All divisors1, 3,4132 in total
Arithmetic
Previous number-3,414
Next number-3,412
Double-6,826
Half-1,706.5
Square11,648,569
Cube-39,756,565,997
Cube root-15.056086323≈
Negation3,413
Reciprocal-0.0002929974≈
Representations
Decimal-3,413
Binary11010101010112 bits
Octal6525
HexadecimalD55
Base 362MT
In wordsminus three thousand, four hundred and thirteen
Ordinalminus three thousand, four hundred and thirteenth
Scientific notation-3.413 × 10^3
Engineering notation-3.413 × 10^3
In other bases
Ternary11200102base 3; the most digit-efficient integer base after e: 8 digits
Quinary102123base 5; one hand: 6 digits
Septenary12644base 7: 5 digits
Nonary4612base 9; each digit is two ternary digits: 4 digits
Duodecimal1b85base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal8adbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal56:53base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT11100TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001010101011
Bit length12 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits5within that length
Bit parityodd7 set bits, so odd; 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 55
Gray code101111111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001010101011two's complement
32-bit11111111111111111111001010101011two's complement
64-bit1111111111111111111111111111111111111111111111111111001010101011two's complement
One's complement0000110101010100at 16 bits, every bit flipped
Bits reversed1101010101001111at 16 bits
Rotated left by 11110010101010111at 16 bits, wrapping
Shifted left by 1-1101010101010= -6,826, no wrap
Shifted right by 1-11010101011= -1,706, discarding the low bit
These bits as a double1.68624605 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,413 to the power 211,648,569
-3,413 to the power 3-39,756,565,997
-3,413 to the power 4135,689,159,747,761
-3,413 to the power 5-463,107,102,219,108,293
First ten multiples-3,413, -6,826, -10,239, -13,652, -17,065, -20,478, -23,891, -27,304, -30,717, -34,130
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-341,300%
-3,413% as a decimal-34.13
-3,413% of 100-3,413
-3,413% of 1,000-34,130
As a fraction of 100-3,413/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,413
Nerdulate something else
Nothing in mind? Surprise me · today’s page