Recognised as Number
-100,423
- Negative
- Odd
- 6 digits
-100,423 is an odd 6-digit integer and the negative of 100,423. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,423
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 × 233 × 431
Distinct prime factors2233, 431
Number of divisors4
Sum of divisors σ(n)101,088
SquarefreeYesno repeated prime factor
All divisors1, 233, 431, 100,4234 in total
Arithmetic
Representations
Decimal-100,423
Binary1100010000100011117 bits
Octal304107
Hexadecimal18847
Base 3625HJ
In wordsminus one hundred thousand, four hundred and twenty-three
Ordinalminus one hundred thousand, four hundred and twenty-third
Scientific notation-1.00423 × 10^5
Engineering notation-100.423 × 10^3
In other bases
Ternary12002202101base 3; the most digit-efficient integer base after e: 11 digits
Quinary11203143base 5; one hand: 8 digits
Septenary565531base 7: 6 digits
Nonary162671base 9; each digit is two ternary digits: 6 digits
Duodecimal4a147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcb13base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:53:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T01T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111011110111001
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 47
Gray code10100110001100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111011110111001two's complement
64-bit1111111111111111111111111111111111111111111111100111011110111001two's complement
One's complement00000000000000011000100001000110at 32 bits, every bit flipped
Bits reversed10011101111011100111111111111111at 32 bits
Rotated left by 111111111111111001110111101110011at 32 bits, wrapping
Shifted left by 1-110001000010001110= -200,846, no wrap
Shifted right by 1-1100010000100100= -50,211, discarding the low bit
These bits as a double4.96155544 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,423 to the power 210,084,778,929
-100,423 to the power 3-1,012,743,754,386,967
-100,423 to the power 4101,702,766,046,802,387,041
-100,423 to the power 5-10,213,296,874,718,036,113,818,343
First ten multiples-100,423, -200,846, -301,269, -401,692, -502,115, -602,538, -702,961, -803,384, -903,807, -1,004,230
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
As a percentage & fraction
As a percentage-10,042,300%
-100,423% as a decimal-1,004.23
-100,423% of 100-100,423
-100,423% of 1,000-1,004,230
As a fraction of 100-100,423/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,423
Nerdulate something else
Nothing in mind? Surprise me · today’s page