Recognised as Number
-13,005
- Negative
- Odd
- 5 digits
-13,005 is an odd 5-digit integer and the negative of 13,005. It has 18 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,005
Digit count5
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 5 × 17^2
Distinct prime factors33, 5, 17
Number of divisors18
Sum of divisors σ(n)23,946
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 17, 45, 51, 85, 153, 255, 289, 765, 867, 1,445, 2,601, 4,335, 13,00518 in total
Arithmetic
Representations
Decimal-13,005
Binary1100101100110114 bits
Octal31315
Hexadecimal32CD
Base 36A19
In wordsminus thirteen thousand and five
Ordinalminus thirteen thousand and fifth
Scientific notation-1.3005 × 10^4
Engineering notation-13.005 × 10^3
In other bases
Ternary122211200base 3; the most digit-efficient integer base after e: 9 digits
Quinary404010base 5; one hand: 6 digits
Septenary52626base 7: 5 digits
Nonary18750base 9; each digit is two ternary digits: 5 digits
Duodecimal7639base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1ca5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:36:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT100011100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100110100110011
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes232 cd
Gray code10101110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100110100110011two's complement
32-bit11111111111111111100110100110011two's complement
64-bit1111111111111111111111111111111111111111111111111100110100110011two's complement
One's complement0011001011001100at 16 bits, every bit flipped
Bits reversed1100110010110011at 16 bits
Rotated left by 11001101001100111at 16 bits, wrapping
Shifted left by 1-110010110011010= -26,010, no wrap
Shifted right by 1-1100101100111= -6,502, discarding the low bit
These bits as a double6.42532372 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-13,005 to the power 2169,130,025
-13,005 to the power 3-2,199,535,975,125
-13,005 to the power 428,604,965,356,500,625
-13,005 to the power 5-372,007,574,461,290,628,125
First ten multiples-13,005, -26,010, -39,015, -52,020, -65,025, -78,030, -91,035, -104,040, -117,045, -130,050
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-1,300,500%
-13,005% as a decimal-130.05
-13,005% of 100-13,005
-13,005% of 1,000-130,050
As a fraction of 100-13,005/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -13,005
Nerdulate something else
Nothing in mind? Surprise me · today’s page