Recognised as Number
-126,013
- Negative
- Odd
- 6 digits
-126,013 is an odd 6-digit integer and the negative of 126,013. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value126,013
Digit count6
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 126,013
Distinct prime factors1126,013
Number of divisors2
Sum of divisors σ(n)126,014
SquarefreeYesno repeated prime factor
All divisors1, 126,0132 in total
Arithmetic
Representations
Decimal-126,013
Binary1111011000011110117 bits
Octal366075
Hexadecimal1EC3D
Base 362P8D
In wordsminus one hundred and twenty-six thousand and thirteen
Ordinalminus one hundred and twenty-six thousand and thirteenth
Scientific notation-1.26013 × 10^5
Engineering notation-126.013 × 10^3
In other bases
Ternary20101212011base 3; the most digit-efficient integer base after e: 11 digits
Quinary13013023base 5; one hand: 8 digits
Septenary1033246base 7: 7 digits
Nonary211764base 9; each digit is two ternary digits: 6 digits
Duodecimal60b11base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalff0dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal35:0:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10TT10110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001010011000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100001001111000011
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 ec 3d
Gray code10001101000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100001001111000011two's complement
64-bit1111111111111111111111111111111111111111111111100001001111000011two's complement
One's complement00000000000000011110110000111100at 32 bits, every bit flipped
Bits reversed11000011110010000111111111111111at 32 bits
Rotated left by 111111111111111000010011110000111at 32 bits, wrapping
Shifted left by 1-111101100001111010= -252,026, no wrap
Shifted right by 1-1111011000011111= -63,006, discarding the low bit
These bits as a double6.22586942 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-126,013 to the power 215,879,276,169
-126,013 to the power 3-2,000,995,227,884,197
-126,013 to the power 4252,151,411,651,371,316,561
-126,013 to the power 5-31,774,355,836,424,253,713,801,293
First ten multiples-126,013, -252,026, -378,039, -504,052, -630,065, -756,078, -882,091, -1,008,104, -1,134,117, -1,260,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-12,601,300%
-126,013% as a decimal-1,260.13
-126,013% of 100-126,013
-126,013% of 1,000-1,260,130
As a fraction of 100-126,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -126,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page