Recognised as Number
-3,455
- Negative
- Odd
- 4 digits
-3,455 is an odd 4-digit integer and the negative of 3,455. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,455
Digit count4
Digit sum17
Digit product300
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 691
Distinct prime factors25, 691
Number of divisors4
Sum of divisors σ(n)4,152
SquarefreeYesno repeated prime factor
All divisors1, 5, 691, 3,4554 in total
Arithmetic
Previous number-3,456
Next number-3,454
Double-6,910
Half-1,727.5
Square11,937,025
Cube-41,242,421,375
Cube root-15.117594216≈
Negation3,455
Reciprocal-0.0002894356≈
Representations
Decimal-3,455
Binary11010111111112 bits
Octal6577
HexadecimalD7F
Base 362NZ
In wordsminus three thousand, four hundred and fifty-five
Ordinalminus three thousand, four hundred and fifty-fifth
Scientific notation-3.455 × 10^3
Engineering notation-3.455 × 10^3
In other bases
Ternary11201222base 3; the most digit-efficient integer base after e: 8 digits
Quinary102310base 5; one hand: 6 digits
Septenary13034base 7: 5 digits
Nonary4658base 9; each digit is two ternary digits: 4 digits
Duodecimal1bbbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal8cfbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal57:35base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT111T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001010000001
Bit length12 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits2within that length
Bit parityeven10 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 7f
Gray code101111000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001010000001two's complement
32-bit11111111111111111111001010000001two's complement
64-bit1111111111111111111111111111111111111111111111111111001010000001two's complement
One's complement0000110101111110at 16 bits, every bit flipped
Bits reversed1000000101001111at 16 bits
Rotated left by 11110010100000011at 16 bits, wrapping
Shifted left by 1-1101011111110= -6,910, no wrap
Shifted right by 1-11011000000= -1,727, discarding the low bit
These bits as a double1.70699681 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,455 to the power 211,937,025
-3,455 to the power 3-41,242,421,375
-3,455 to the power 4142,492,565,850,625
-3,455 to the power 5-492,311,815,013,909,375
First ten multiples-3,455, -6,910, -10,365, -13,820, -17,275, -20,730, -24,185, -27,640, -31,095, -34,550
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 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
As a percentage & fraction
As a percentage-345,500%
-3,455% as a decimal-34.55
-3,455% of 100-3,455
-3,455% of 1,000-34,550
As a fraction of 100-3,455/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,455
Nerdulate something else
Nothing in mind? Surprise me · today’s page