Recognised as Number
-36,101
- Negative
- Odd
- 5 digits
-36,101 is an odd 5-digit integer and the negative of 36,101. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value36,101
Digit count5
Digit sum11
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 × 13 × 2,777
Distinct prime factors213, 2,777
Number of divisors4
Sum of divisors σ(n)38,892
SquarefreeYesno repeated prime factor
All divisors1, 13, 2,777, 36,1014 in total
Arithmetic
Representations
Decimal-36,101
Binary100011010000010116 bits
Octal106405
Hexadecimal8D05
Base 36RUT
In wordsminus thirty-six thousand, one hundred and one
Ordinalminus thirty-six thousand, one hundred and first
Scientific notation-3.6101 × 10^4
Engineering notation-36.101 × 10^3
In other bases
Ternary1211112002base 3; the most digit-efficient integer base after e: 10 digits
Quinary2123401base 5; one hand: 7 digits
Septenary210152base 7: 6 digits
Nonary54462base 9; each digit is two ternary digits: 5 digits
Duodecimal18a85base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4a51base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:1:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10111110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011011100001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110111001011111011
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes28d 05
Gray code1100101110000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110111001011111011two's complement
64-bit1111111111111111111111111111111111111111111111110111001011111011two's complement
One's complement00000000000000001000110100000100at 32 bits, every bit flipped
Bits reversed11011111010011101111111111111111at 32 bits
Rotated left by 111111111111111101110010111110111at 32 bits, wrapping
Shifted left by 1-10001101000001010= -72,202, no wrap
Shifted right by 1-100011010000011= -18,050, discarding the low bit
These bits as a double1.78362639 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-36,101 to the power 21,303,282,201
-36,101 to the power 3-47,049,790,738,301
-36,101 to the power 41,698,544,495,443,404,401
-36,101 to the power 5-61,319,154,830,002,342,280,501
First ten multiples-36,101, -72,202, -108,303, -144,404, -180,505, -216,606, -252,707, -288,808, -324,909, -361,010
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-3,610,100%
-36,101% as a decimal-361.01
-36,101% of 100-36,101
-36,101% of 1,000-361,010
As a fraction of 100-36,101/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -36,101
Nerdulate something else
Nothing in mind? Surprise me · today’s page