Recognised as Number
-103,521
- Negative
- Odd
- 6 digits
-103,521 is an odd 6-digit integer and the negative of 103,521. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value103,521
Digit count6
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 3,137
Distinct prime factors33, 11, 3,137
Number of divisors8
Sum of divisors σ(n)150,624
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 3,137, 9,411, 34,507, 103,5218 in total
Arithmetic
Representations
Decimal-103,521
Binary1100101000110000117 bits
Octal312141
Hexadecimal19461
Base 3627VL
In wordsminus one hundred and three thousand, five hundred and twenty-one
Ordinalminus one hundred and three thousand, five hundred and twenty-first
Scientific notation-1.03521 × 10^5
Engineering notation-103.521 × 10^3
In other bases
Ternary12021000010base 3; the most digit-efficient integer base after e: 11 digits
Quinary11303041base 5; one hand: 8 digits
Septenary610545base 7: 6 digits
Nonary167003base 9; each digit is two ternary digits: 6 digits
Duodecimal4baa9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcig1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:45:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T1T0000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011110011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100110101110011111
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; 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 94 61
Gray code10101111001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100110101110011111two's complement
64-bit1111111111111111111111111111111111111111111111100110101110011111two's complement
One's complement00000000000000011001010001100000at 32 bits, every bit flipped
Bits reversed11111001110101100111111111111111at 32 bits
Rotated left by 111111111111111001101011100111111at 32 bits, wrapping
Shifted left by 1-110010100011000010= -207,042, no wrap
Shifted right by 1-1100101000110001= -51,760, discarding the low bit
These bits as a double5.11461697 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-103,521 to the power 210,716,597,441
-103,521 to the power 3-1,109,392,883,689,761
-103,521 to the power 4114,845,460,712,447,748,481
-103,521 to the power 5-11,888,916,938,413,303,370,501,601
First ten multiples-103,521, -207,042, -310,563, -414,084, -517,605, -621,126, -724,647, -828,168, -931,689, -1,035,210
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-10,352,100%
-103,521% as a decimal-1,035.21
-103,521% of 100-103,521
-103,521% of 1,000-1,035,210
As a fraction of 100-103,521/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -103,521
Nerdulate something else
Nothing in mind? Surprise me · today’s page