Recognised as Number
-14,953
- Negative
- Odd
- 5 digits
-14,953 is an odd 5-digit integer and the negative of 14,953. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value14,953
Digit count5
Digit sum22
Digit product540
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 19 × 787
Distinct prime factors219, 787
Number of divisors4
Sum of divisors σ(n)15,760
SquarefreeYesno repeated prime factor
All divisors1, 19, 787, 14,9534 in total
Arithmetic
Representations
Decimal-14,953
Binary1110100110100114 bits
Octal35151
Hexadecimal3A69
Base 36BJD
In wordsminus fourteen thousand, nine hundred and fifty-three
Ordinalminus fourteen thousand, nine hundred and fifty-third
Scientific notation-1.4953 × 10^4
Engineering notation-14.953 × 10^3
In other bases
Ternary202111211base 3; the most digit-efficient integer base after e: 9 digits
Quinary434303base 5; one hand: 6 digits
Septenary61411base 7: 5 digits
Nonary22454base 9; each digit is two ternary digits: 5 digits
Duodecimal87a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1h7dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:9:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101011101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100010110010111
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
Bytes23a 69
Gray code10011101011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100010110010111two's complement
32-bit11111111111111111100010110010111two's complement
64-bit1111111111111111111111111111111111111111111111111100010110010111two's complement
One's complement0011101001101000at 16 bits, every bit flipped
Bits reversed1110100110100011at 16 bits
Rotated left by 11000101100101111at 16 bits, wrapping
Shifted left by 1-111010011010010= -29,906, no wrap
Shifted right by 1-1110100110101= -7,476, discarding the low bit
These bits as a double7.3877636 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-14,953 to the power 2223,592,209
-14,953 to the power 3-3,343,374,301,177
-14,953 to the power 449,993,475,925,499,681
-14,953 to the power 5-747,552,445,513,996,729,993
First ten multiples-14,953, -29,906, -44,859, -59,812, -74,765, -89,718, -104,671, -119,624, -134,577, -149,530
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-1,495,300%
-14,953% as a decimal-149.53
-14,953% of 100-14,953
-14,953% of 1,000-149,530
As a fraction of 100-14,953/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -14,953
Nerdulate something else
Nothing in mind? Surprise me · today’s page