Recognised as Number
-1,537
- Negative
- Odd
- 4 digits
-1,537 is an odd 4-digit integer and the negative of 1,537. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,537
Digit count4
Digit sum16
Digit product105
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 29 × 53
Distinct prime factors229, 53
Number of divisors4
Sum of divisors σ(n)1,620
SquarefreeYesno repeated prime factor
All divisors1, 29, 53, 1,5374 in total
Arithmetic
Representations
Decimal-1,537
Binary1100000000111 bits
Octal3001
Hexadecimal601
Base 3616P
In wordsminus one thousand, five hundred and thirty-seven
Ordinalminus one thousand, five hundred and thirty-seventh
Scientific notation-1.537 × 10^3
Engineering notation-1.537 × 10^3
In other bases
Ternary2002221base 3; the most digit-efficient integer base after e: 7 digits
Quinary22122base 5; one hand: 5 digits
Septenary4324base 7: 4 digits
Nonary2087base 9; each digit is two ternary digits: 4 digits
Duodecimala81base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal3ghbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal25:37base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT10T001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100111111111
Bit length11 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits8within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes206 01
Gray code10100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100111111111two's complement
32-bit11111111111111111111100111111111two's complement
64-bit1111111111111111111111111111111111111111111111111111100111111111two's complement
One's complement0000011000000000at 16 bits, every bit flipped
Bits reversed1111111110011111at 16 bits
Rotated left by 11111001111111111at 16 bits, wrapping
Shifted left by 1-110000000010= -3,074, no wrap
Shifted right by 1-1100000001= -768, discarding the low bit
These bits as a double7.59378898 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-1,537 to the power 22,362,369
-1,537 to the power 3-3,630,961,153
-1,537 to the power 45,580,787,292,161
-1,537 to the power 5-8,577,670,068,051,457
First ten multiples-1,537, -3,074, -4,611, -6,148, -7,685, -9,222, -10,759, -12,296, -13,833, -15,370
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-153,700%
-1,537% as a decimal-15.37
-1,537% of 100-1,537
-1,537% of 1,000-15,370
As a fraction of 100-1,537/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -1,537
Nerdulate something else
Nothing in mind? Surprise me · today’s page