Recognised as Number
-15,231
- Negative
- Odd
- 5 digits
-15,231 is an odd 5-digit integer and the negative of 15,231. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value15,231
Digit count5
Digit sum12
Digit product30
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5,077
Distinct prime factors23, 5,077
Number of divisors4
Sum of divisors σ(n)20,312
SquarefreeYesno repeated prime factor
All divisors1, 3, 5,077, 15,2314 in total
Arithmetic
Representations
Decimal-15,231
Binary1110110111111114 bits
Octal35577
Hexadecimal3B7F
Base 36BR3
In wordsminus fifteen thousand, two hundred and thirty-one
Ordinalminus fifteen thousand, two hundred and thirty-first
Scientific notation-1.5231 × 10^4
Engineering notation-15.231 × 10^3
In other bases
Ternary202220010base 3; the most digit-efficient integer base after e: 9 digits
Quinary441411base 5; one hand: 6 digits
Septenary62256base 7: 5 digits
Nonary22803base 9; each digit is two ternary digits: 5 digits
Duodecimal8993base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1i1bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:13:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T00100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100010010000001
Bit length14 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits2within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes23b 7f
Gray code10011011000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100010010000001two's complement
32-bit11111111111111111100010010000001two's complement
64-bit1111111111111111111111111111111111111111111111111100010010000001two's complement
One's complement0011101101111110at 16 bits, every bit flipped
Bits reversed1000000100100011at 16 bits
Rotated left by 11000100100000011at 16 bits, wrapping
Shifted left by 1-111011011111110= -30,462, no wrap
Shifted right by 1-1110111000000= -7,615, discarding the low bit
These bits as a double7.52511385 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-15,231 to the power 2231,983,361
-15,231 to the power 3-3,533,338,571,391
-15,231 to the power 453,816,279,780,856,321
-15,231 to the power 5-819,675,757,342,222,625,151
First ten multiples-15,231, -30,462, -45,693, -60,924, -76,155, -91,386, -106,617, -121,848, -137,079, -152,310
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-1,523,100%
-15,231% as a decimal-152.31
-15,231% of 100-15,231
-15,231% of 1,000-152,310
As a fraction of 100-15,231/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -15,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page