Recognised as Number
-51,009
- Negative
- Odd
- 5 digits
-51,009 is an odd 5-digit integer and the negative of 51,009. It has 12 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value51,009
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7^2 × 347
Distinct prime factors33, 7, 347
Number of divisors12
Sum of divisors σ(n)79,344
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 21, 49, 147, 347, 1,041, 2,429, 7,287, 17,003, 51,00912 in total
Arithmetic
Representations
Decimal-51,009
Binary110001110100000116 bits
Octal143501
HexadecimalC741
Base 3613CX
In wordsminus fifty-one thousand and nine
Ordinalminus fifty-one thousand and ninth
Scientific notation-5.1009 × 10^4
Engineering notation-51.009 × 10^3
In other bases
Ternary2120222020base 3; the most digit-efficient integer base after e: 10 digits
Quinary3113014base 5; one hand: 7 digits
Septenary301500base 7: 6 digits
Nonary76866base 9; each digit is two ternary digits: 5 digits
Duodecimal25629base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal67a9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal14:10:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT011T001T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100100111000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110011100010111111
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 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
Bytes2c7 41
Gray code1010010011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110011100010111111two's complement
64-bit1111111111111111111111111111111111111111111111110011100010111111two's complement
One's complement00000000000000001100011101000000at 32 bits, every bit flipped
Bits reversed11111101000111001111111111111111at 32 bits
Rotated left by 111111111111111100111000101111111at 32 bits, wrapping
Shifted left by 1-11000111010000010= -102,018, no wrap
Shifted right by 1-110001110100001= -25,504, discarding the low bit
These bits as a double2.52017945 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-51,009 to the power 22,601,918,081
-51,009 to the power 3-132,721,239,393,729
-51,009 to the power 46,769,977,700,234,722,561
-51,009 to the power 5-345,329,792,511,272,963,114,049
First ten multiples-51,009, -102,018, -153,027, -204,036, -255,045, -306,054, -357,063, -408,072, -459,081, -510,090
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 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-5,100,900%
-51,009% as a decimal-510.09
-51,009% of 100-51,009
-51,009% of 1,000-510,090
As a fraction of 100-51,009/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -51,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page