Recognised as Number
-103,013
- Negative
- Odd
- 6 digits
-103,013 is an odd 6-digit integer and the negative of 103,013. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value103,013
Digit count6
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 31 × 3,323
Distinct prime factors231, 3,323
Number of divisors4
Sum of divisors σ(n)106,368
SquarefreeYesno repeated prime factor
All divisors1, 31, 3,323, 103,0134 in total
Arithmetic
Representations
Decimal-103,013
Binary1100100100110010117 bits
Octal311145
Hexadecimal19265
Base 3627HH
In wordsminus one hundred and three thousand and thirteen
Ordinalminus one hundred and three thousand and thirteenth
Scientific notation-1.03013 × 10^5
Engineering notation-103.013 × 10^3
In other bases
Ternary12020022022base 3; the most digit-efficient integer base after e: 11 digits
Quinary11244023base 5; one hand: 8 digits
Septenary606221base 7: 6 digits
Nonary166268base 9; each digit is two ternary digits: 6 digits
Duodecimal4b745base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalchadbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:36:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T10T01T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011001011101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100110110110011011
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 92 65
Gray code10101101101010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100110110110011011two's complement
64-bit1111111111111111111111111111111111111111111111100110110110011011two's complement
One's complement00000000000000011001001001100100at 32 bits, every bit flipped
Bits reversed11011001101101100111111111111111at 32 bits
Rotated left by 111111111111111001101101100110111at 32 bits, wrapping
Shifted left by 1-110010010011001010= -206,026, no wrap
Shifted right by 1-1100100100110011= -51,506, discarding the low bit
These bits as a double5.08951844 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-103,013 to the power 210,611,678,169
-103,013 to the power 3-1,093,140,803,223,197
-103,013 to the power 4112,607,713,562,431,192,561
-103,013 to the power 5-11,600,058,397,206,724,439,286,293
First ten multiples-103,013, -206,026, -309,039, -412,052, -515,065, -618,078, -721,091, -824,104, -927,117, -1,030,130
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-10,301,300%
-103,013% as a decimal-1,030.13
-103,013% of 100-103,013
-103,013% of 1,000-1,030,130
As a fraction of 100-103,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -103,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page