Recognised as Number
-103,041
- Negative
- Odd
- Perfect square
- 6 digits
-103,041 is an odd 6-digit integer and the negative of 103,041. It has 9 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value103,041
Digit count6
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 321²
Factors & divisors
Prime factorisation−1 × 3^2 × 107^2
Distinct prime factors23, 107
Number of divisors9
Sum of divisors σ(n)150,241
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 107, 321, 963, 11,449, 34,347, 103,0419 in total
Arithmetic
Representations
Decimal-103,041
Binary1100100101000000117 bits
Octal311201
Hexadecimal19281
Base 3627I9
In wordsminus one hundred and three thousand and forty-one
Ordinalminus one hundred and three thousand and forty-first
Scientific notation-1.03041 × 10^5
Engineering notation-103.041 × 10^3
In other bases
Ternary12020100100base 3; the most digit-efficient integer base after e: 11 digits
Quinary11244131base 5; one hand: 8 digits
Septenary606261base 7: 6 digits
Nonary166310base 9; each digit is two ternary digits: 6 digits
Duodecimal4b769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalchc1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:37:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T10T00T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011001010000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100110110101111111
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 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 81
Gray code10101101111000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100110110101111111two's complement
64-bit1111111111111111111111111111111111111111111111100110110101111111two's complement
One's complement00000000000000011001001010000000at 32 bits, every bit flipped
Bits reversed11111110101101100111111111111111at 32 bits
Rotated left by 111111111111111001101101011111111at 32 bits, wrapping
Shifted left by 1-110010010100000010= -206,082, no wrap
Shifted right by 1-1100100101000001= -51,520, discarding the low bit
These bits as a double5.09090182 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-103,041 to the power 210,617,447,681
-103,041 to the power 3-1,094,032,426,497,921
-103,041 to the power 4112,730,195,258,772,277,761
-103,041 to the power 5-11,615,832,049,659,154,272,771,201
First ten multiples-103,041, -206,082, -309,123, -412,164, -515,205, -618,246, -721,287, -824,328, -927,369, -1,030,410
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-10,304,100%
-103,041% as a decimal-1,030.41
-103,041% of 100-103,041
-103,041% of 1,000-1,030,410
As a fraction of 100-103,041/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -103,041
Nerdulate something else
Nothing in mind? Surprise me · today’s page