Recognised as Number
-10,201
- Negative
- Odd
- Perfect square
- 5 digits
-10,201 is an odd 5-digit integer and the negative of 10,201. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,201
Digit count5
Digit sum4
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
PalindromicYesreads the same backwards
Perfect squareYes, 101²
Factors & divisors
Prime factorisation−1 × 101^2
Distinct prime factors1101
Number of divisors3
Sum of divisors σ(n)10,303
SquarefreeNohas a repeated prime factor
All divisors1, 101, 10,2013 in total
Arithmetic
Representations
Decimal-10,201
Binary1001111101100114 bits
Octal23731
Hexadecimal27D9
Base 367VD
In wordsminus ten thousand, two hundred and one
Ordinalminus ten thousand, two hundred and first
Scientific notation-1.0201 × 10^4
Engineering notation-10.201 × 10^3
In other bases
Ternary111222211base 3; the most digit-efficient integer base after e: 9 digits
Quinary311301base 5; one hand: 6 digits
Septenary41512base 7: 5 digits
Nonary14884base 9; each digit is two ternary digits: 5 digits
Duodecimal5aa1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal15a1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:50:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1110001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101100000100111
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes227 d9
Gray code11010000110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101100000100111two's complement
32-bit11111111111111111101100000100111two's complement
64-bit1111111111111111111111111111111111111111111111111101100000100111two's complement
One's complement0010011111011000at 16 bits, every bit flipped
Bits reversed1110010000011011at 16 bits
Rotated left by 11011000001001111at 16 bits, wrapping
Shifted left by 1-100111110110010= -20,402, no wrap
Shifted right by 1-1001111101101= -5,100, discarding the low bit
These bits as a double5.03996365 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10,201 to the power 2104,060,401
-10,201 to the power 3-1,061,520,150,601
-10,201 to the power 410,828,567,056,280,801
-10,201 to the power 5-110,462,212,541,120,451,001
First ten multiples-10,201, -20,402, -30,603, -40,804, -51,005, -61,206, -71,407, -81,608, -91,809, -102,010
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-1,020,100%
-10,201% as a decimal-102.01
-10,201% of 100-10,201
-10,201% of 1,000-102,010
As a fraction of 100-10,201/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10,201
Nerdulate something else
Nothing in mind? Surprise me · today’s page