Recognised as Number
-15,270
- Negative
- Even
- 5 digits
-15,270 is an even 5-digit integer and the negative of 15,270. It has 16 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value15,270
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 × 2 × 3 × 5 × 509
Distinct prime factors42, 3, 5, 509
Number of divisors16
Sum of divisors σ(n)36,720
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 30, 509, 1,018, 1,527, 2,545, 3,054, 5,090, 7,635, 15,27016 in total
Arithmetic
Representations
Decimal-15,270
Binary1110111010011014 bits
Octal35646
Hexadecimal3BA6
Base 36BS6
In wordsminus fifteen thousand, two hundred and seventy
Ordinalminus fifteen thousand, two hundred and seventieth
Scientific notation-1.527 × 10^4
Engineering notation-15.27 × 10^3
In other bases
Ternary202221120base 3; the most digit-efficient integer base after e: 9 digits
Quinary442040base 5; one hand: 6 digits
Septenary62343base 7: 5 digits
Nonary22846base 9; each digit is two ternary digits: 5 digits
Duodecimal8a06base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1i3abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:14:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0001110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010110101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100010001011010
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes23b a6
Gray code10011001110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100010001011010two's complement
32-bit11111111111111111100010001011010two's complement
64-bit1111111111111111111111111111111111111111111111111100010001011010two's complement
One's complement0011101110100101at 16 bits, every bit flipped
Bits reversed0101101000100011at 16 bits
Rotated left by 11000100010110101at 16 bits, wrapping
Shifted left by 1-111011101001100= -30,540, no wrap
Shifted right by 1-1110111010011= -7,635, discarding the low bit
These bits as a double7.54438241 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-15,270 to the power 2233,172,900
-15,270 to the power 3-3,560,550,183,000
-15,270 to the power 454,369,601,294,410,000
-15,270 to the power 5-830,223,811,765,640,700,000
First ten multiples-15,270, -30,540, -45,810, -61,080, -76,350, -91,620, -106,890, -122,160, -137,430, -152,700
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-1,527,000%
-15,270% as a decimal-152.7
-15,270% of 100-15,270
-15,270% of 1,000-152,700
As a fraction of 100-15,270/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -15,270
Nerdulate something else
Nothing in mind? Surprise me · today’s page