Recognised as Number
-16,315
- Negative
- Odd
- 5 digits
-16,315 is an odd 5-digit integer and the negative of 16,315. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,315
Digit count5
Digit sum16
Digit product90
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 13 × 251
Distinct prime factors35, 13, 251
Number of divisors8
Sum of divisors σ(n)21,168
SquarefreeYesno repeated prime factor
All divisors1, 5, 13, 65, 251, 1,255, 3,263, 16,3158 in total
Arithmetic
Representations
Decimal-16,315
Binary1111111011101114 bits
Octal37673
Hexadecimal3FBB
Base 36CL7
In wordsminus sixteen thousand, three hundred and fifteen
Ordinalminus sixteen thousand, three hundred and fifteenth
Scientific notation-1.6315 × 10^4
Engineering notation-16.315 × 10^3
In other bases
Ternary211101021base 3; the most digit-efficient integer base after e: 9 digits
Quinary1010230base 5; one hand: 7 digits
Septenary65365base 7: 5 digits
Nonary24337base 9; each digit is two ternary digits: 5 digits
Duodecimal9537base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal20ffbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:31:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT0TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000001000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100000001000101
Bit length14 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits2within that length
Bit parityeven12 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
Bytes23f bb
Gray code10000001100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100000001000101two's complement
32-bit11111111111111111100000001000101two's complement
64-bit1111111111111111111111111111111111111111111111111100000001000101two's complement
One's complement0011111110111010at 16 bits, every bit flipped
Bits reversed1010001000000011at 16 bits
Rotated left by 11000000010001011at 16 bits, wrapping
Shifted left by 1-111111101110110= -32,630, no wrap
Shifted right by 1-1111111011110= -8,157, discarding the low bit
These bits as a double8.06068101 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-16,315 to the power 2266,179,225
-16,315 to the power 3-4,342,714,055,875
-16,315 to the power 470,851,379,821,600,625
-16,315 to the power 5-1,155,940,261,789,414,196,875
First ten multiples-16,315, -32,630, -48,945, -65,260, -81,575, -97,890, -114,205, -130,520, -146,835, -163,150
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 15
As a percentage & fraction
As a percentage-1,631,500%
-16,315% as a decimal-163.15
-16,315% of 100-16,315
-16,315% of 1,000-163,150
As a fraction of 100-16,315/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -16,315
Nerdulate something else
Nothing in mind? Surprise me · today’s page