Recognised as Number
-100,315
- Negative
- Odd
- 6 digits
-100,315 is an odd 6-digit integer and the negative of 100,315. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,315
Digit count6
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 20,063
Distinct prime factors25, 20,063
Number of divisors4
Sum of divisors σ(n)120,384
SquarefreeYesno repeated prime factor
All divisors1, 5, 20,063, 100,3154 in total
Arithmetic
Representations
Decimal-100,315
Binary1100001111101101117 bits
Octal303733
Hexadecimal187DB
Base 3625EJ
In wordsminus one hundred thousand, three hundred and fifteen
Ordinalminus one hundred thousand, three hundred and fifteenth
Scientific notation-1.00315 × 10^5
Engineering notation-100.315 × 10^3
In other bases
Ternary12002121101base 3; the most digit-efficient integer base after e: 11 digits
Quinary11202230base 5; one hand: 8 digits
Septenary565315base 7: 6 digits
Nonary162541base 9; each digit is two ternary digits: 6 digits
Duodecimal4a077base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcaffbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:51:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T011TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111100000100101
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 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 87 db
Gray code10100010000110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111100000100101two's complement
64-bit1111111111111111111111111111111111111111111111100111100000100101two's complement
One's complement00000000000000011000011111011010at 32 bits, every bit flipped
Bits reversed10100100000111100111111111111111at 32 bits
Rotated left by 111111111111111001111000001001011at 32 bits, wrapping
Shifted left by 1-110000111110110110= -200,630, no wrap
Shifted right by 1-1100001111101110= -50,157, discarding the low bit
These bits as a double4.95621953 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,315 to the power 210,063,099,225
-100,315 to the power 3-1,009,479,798,755,875
-100,315 to the power 4101,265,966,012,195,600,625
-100,315 to the power 5-10,158,495,380,513,401,676,696,875
First ten multiples-100,315, -200,630, -300,945, -401,260, -501,575, -601,890, -702,205, -802,520, -902,835, -1,003,150
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 15
As a percentage & fraction
As a percentage-10,031,500%
-100,315% as a decimal-1,003.15
-100,315% of 100-100,315
-100,315% of 1,000-1,003,150
As a fraction of 100-100,315/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,315
Nerdulate something else
Nothing in mind? Surprise me · today’s page