Recognised as Number
-19,013
- Negative
- Odd
- 5 digits
-19,013 is an odd 5-digit integer and the negative of 19,013. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value19,013
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 19,013
Distinct prime factors119,013
Number of divisors2
Sum of divisors σ(n)19,014
SquarefreeYesno repeated prime factor
All divisors1, 19,0132 in total
Arithmetic
Representations
Decimal-19,013
Binary10010100100010115 bits
Octal45105
Hexadecimal4A45
Base 36EO5
In wordsminus nineteen thousand and thirteen
Ordinalminus nineteen thousand and thirteenth
Scientific notation-1.9013 × 10^4
Engineering notation-19.013 × 10^3
In other bases
Ternary222002012base 3; the most digit-efficient integer base after e: 9 digits
Quinary1102023base 5; one hand: 7 digits
Septenary106301base 7: 6 digits
Nonary28065base 9; each digit is two ternary digits: 5 digits
Duodecimalb005base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal27adbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:16:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0010T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101011001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011010110111011
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24a 45
Gray code110111101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011010110111011two's complement
32-bit11111111111111111011010110111011two's complement
64-bit1111111111111111111111111111111111111111111111111011010110111011two's complement
One's complement0100101001000100at 16 bits, every bit flipped
Bits reversed1101110110101101at 16 bits
Rotated left by 10110101101110111at 16 bits, wrapping
Shifted left by 1-1001010010001010= -38,026, no wrap
Shifted right by 1-10010100100011= -9,506, discarding the low bit
These bits as a double9.39367012 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-19,013 to the power 2361,494,169
-19,013 to the power 3-6,873,088,635,197
-19,013 to the power 4130,678,034,221,000,561
-19,013 to the power 5-2,484,581,464,643,883,666,293
First ten multiples-19,013, -38,026, -57,039, -76,052, -95,065, -114,078, -133,091, -152,104, -171,117, -190,130
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-1,901,300%
-19,013% as a decimal-190.13
-19,013% of 100-19,013
-19,013% of 1,000-190,130
As a fraction of 100-19,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -19,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page