Recognised as Number
-53,253
- Negative
- Odd
- 5 digits
-53,253 is an odd 5-digit integer and the negative of 53,253. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value53,253
Digit count5
Digit sum18
Digit product450
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 61 × 97
Distinct prime factors33, 61, 97
Number of divisors12
Sum of divisors σ(n)78,988
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 61, 97, 183, 291, 549, 873, 5,917, 17,751, 53,25312 in total
Arithmetic
Representations
Decimal-53,253
Binary110100000000010116 bits
Octal150005
HexadecimalD005
Base 361539
In wordsminus fifty-three thousand, two hundred and fifty-three
Ordinalminus fifty-three thousand, two hundred and fifty-third
Scientific notation-5.3253 × 10^4
Engineering notation-53.253 × 10^3
In other bases
Ternary2201001100base 3; the most digit-efficient integer base after e: 10 digits
Quinary3201003base 5; one hand: 7 digits
Septenary311154base 7: 6 digits
Nonary81040base 9; each digit is two ternary digits: 5 digits
Duodecimal26999base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6d2dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:47:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT010T00TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110111000000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110010111111111011
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2d0 05
Gray code1011100000000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110010111111111011two's complement
64-bit1111111111111111111111111111111111111111111111110010111111111011two's complement
One's complement00000000000000001101000000000100at 32 bits, every bit flipped
Bits reversed11011111111101001111111111111111at 32 bits
Rotated left by 111111111111111100101111111110111at 32 bits, wrapping
Shifted left by 1-11010000000001010= -106,506, no wrap
Shifted right by 1-110100000000011= -26,626, discarding the low bit
These bits as a double2.63104778 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-53,253 to the power 22,835,882,009
-53,253 to the power 3-151,019,224,625,277
-53,253 to the power 48,042,226,768,969,876,081
-53,253 to the power 5-428,272,702,127,952,810,941,493
First ten multiples-53,253, -106,506, -159,759, -213,012, -266,265, -319,518, -372,771, -426,024, -479,277, -532,530
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-5,325,300%
-53,253% as a decimal-532.53
-53,253% of 100-53,253
-53,253% of 1,000-532,530
As a fraction of 100-53,253/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -53,253
Nerdulate something else
Nothing in mind? Surprise me · today’s page