Recognised as Number
-100,397
- Negative
- Odd
- 6 digits
-100,397 is an odd 6-digit integer and the negative of 100,397. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,397
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 9,127
Distinct prime factors211, 9,127
Number of divisors4
Sum of divisors σ(n)109,536
SquarefreeYesno repeated prime factor
All divisors1, 11, 9,127, 100,3974 in total
Arithmetic
Representations
Decimal-100,397
Binary1100010000010110117 bits
Octal304055
Hexadecimal1882D
Base 3625GT
In wordsminus one hundred thousand, three hundred and ninety-seven
Ordinalminus one hundred thousand, three hundred and ninety-seventh
Scientific notation-1.00397 × 10^5
Engineering notation-100.397 × 10^3
In other bases
Ternary12002201102base 3; the most digit-efficient integer base after e: 11 digits
Quinary11203042base 5; one hand: 8 digits
Septenary565463base 7: 6 digits
Nonary162642base 9; each digit is two ternary digits: 6 digits
Duodecimal4a125base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcajhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:53:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T010TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100011010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111011111010011
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 88 2d
Gray code10100110000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111011111010011two's complement
64-bit1111111111111111111111111111111111111111111111100111011111010011two's complement
One's complement00000000000000011000100000101100at 32 bits, every bit flipped
Bits reversed11001011111011100111111111111111at 32 bits
Rotated left by 111111111111111001110111110100111at 32 bits, wrapping
Shifted left by 1-110001000001011010= -200,794, no wrap
Shifted right by 1-1100010000010111= -50,198, discarding the low bit
These bits as a double4.96027086 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,397 to the power 210,079,557,609
-100,397 to the power 3-1,011,957,345,270,773
-100,397 to the power 4101,597,481,593,149,796,881
-100,397 to the power 5-10,200,082,359,507,460,157,461,757
First ten multiples-100,397, -200,794, -301,191, -401,588, -501,985, -602,382, -702,779, -803,176, -903,573, -1,003,970
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-10,039,700%
-100,397% as a decimal-1,003.97
-100,397% of 100-100,397
-100,397% of 1,000-1,003,970
As a fraction of 100-100,397/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,397
Nerdulate something else
Nothing in mind? Surprise me · today’s page