Recognised as Number
-14,110
- Negative
- Even
- 5 digits
-14,110 is an even 5-digit integer and the negative of 14,110. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value14,110
Digit count5
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 17 × 83
Distinct prime factors42, 5, 17, 83
Number of divisors16
Sum of divisors σ(n)27,216
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 17, 34, 83, 85, 166, 170, 415, 830, 1,411, 2,822, 7,055, 14,11016 in total
Arithmetic
Representations
Decimal-14,110
Binary1101110001111014 bits
Octal33436
Hexadecimal371E
Base 36AVY
In wordsminus fourteen thousand, one hundred and ten
Ordinalminus fourteen thousand, one hundred and tenth
Scientific notation-1.411 × 10^4
Engineering notation-14.11 × 10^3
In other bases
Ternary201100121base 3; the most digit-efficient integer base after e: 9 digits
Quinary422420base 5; one hand: 6 digits
Septenary56065base 7: 5 digits
Nonary21317base 9; each digit is two ternary digits: 5 digits
Duodecimal81babase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1f5abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:55:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10TT0T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100100100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100100011100010
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes237 1e
Gray code10110010010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100100011100010two's complement
32-bit11111111111111111100100011100010two's complement
64-bit1111111111111111111111111111111111111111111111111100100011100010two's complement
One's complement0011011100011101at 16 bits, every bit flipped
Bits reversed0100011100010011at 16 bits
Rotated left by 11001000111000101at 16 bits, wrapping
Shifted left by 1-110111000111100= -28,220, no wrap
Shifted right by 1-1101110001111= -7,055, discarding the low bit
These bits as a double6.97126626 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-14,110 to the power 2199,092,100
-14,110 to the power 3-2,809,189,531,000
-14,110 to the power 439,637,664,282,410,000
-14,110 to the power 5-559,287,443,024,805,100,000
First ten multiples-14,110, -28,220, -42,330, -56,440, -70,550, -84,660, -98,770, -112,880, -126,990, -141,100
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 10
As a percentage & fraction
As a percentage-1,411,000%
-14,110% as a decimal-141.1
-14,110% of 100-14,110
-14,110% of 1,000-141,100
As a fraction of 100-14,110/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -14,110
Nerdulate something else
Nothing in mind? Surprise me · today’s page