Recognised as Number
-14,290
- Negative
- Even
- 5 digits
-14,290 is an even 5-digit integer and the negative of 14,290. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value14,290
Digit count5
Digit sum16
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 × 1,429
Distinct prime factors32, 5, 1,429
Number of divisors8
Sum of divisors σ(n)25,740
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 1,429, 2,858, 7,145, 14,2908 in total
Arithmetic
Representations
Decimal-14,290
Binary1101111101001014 bits
Octal33722
Hexadecimal37D2
Base 36B0Y
In wordsminus fourteen thousand, two hundred and ninety
Ordinalminus fourteen thousand, two hundred and ninetieth
Scientific notation-1.429 × 10^4
Engineering notation-14.29 × 10^3
In other bases
Ternary201121021base 3; the most digit-efficient integer base after e: 9 digits
Quinary424130base 5; one hand: 6 digits
Septenary56443base 7: 5 digits
Nonary21537base 9; each digit is two ternary digits: 5 digits
Duodecimal832abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1feabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:58:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T111TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100100000101110
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 d2
Gray code10110000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100100000101110two's complement
32-bit11111111111111111100100000101110two's complement
64-bit1111111111111111111111111111111111111111111111111100100000101110two's complement
One's complement0011011111010001at 16 bits, every bit flipped
Bits reversed0111010000010011at 16 bits
Rotated left by 11001000001011101at 16 bits, wrapping
Shifted left by 1-110111110100100= -28,580, no wrap
Shifted right by 1-1101111101001= -7,145, discarding the low bit
These bits as a double7.06019808 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-14,290 to the power 2204,204,100
-14,290 to the power 3-2,918,076,589,000
-14,290 to the power 441,699,314,456,810,000
-14,290 to the power 5-595,883,203,587,814,900,000
First ten multiples-14,290, -28,580, -42,870, -57,160, -71,450, -85,740, -100,030, -114,320, -128,610, -142,900
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 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-1,429,000%
-14,290% as a decimal-142.9
-14,290% of 100-14,290
-14,290% of 1,000-142,900
As a fraction of 100-14,290/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -14,290
Nerdulate something else
Nothing in mind? Surprise me · today’s page