Recognised as Number
-26,453
- Negative
- Odd
- 5 digits
-26,453 is an odd 5-digit integer and the negative of 26,453. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value26,453
Digit count5
Digit sum20
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 3,779
Distinct prime factors27, 3,779
Number of divisors4
Sum of divisors σ(n)30,240
SquarefreeYesno repeated prime factor
All divisors1, 7, 3,779, 26,4534 in total
Arithmetic
Representations
Decimal-26,453
Binary11001110101010115 bits
Octal63525
Hexadecimal6755
Base 36KET
In wordsminus twenty-six thousand, four hundred and fifty-three
Ordinalminus twenty-six thousand, four hundred and fifty-third
Scientific notation-2.6453 × 10^4
Engineering notation-26.453 × 10^3
In other bases
Ternary1100021202base 3; the most digit-efficient integer base after e: 10 digits
Quinary1321303base 5; one hand: 7 digits
Septenary140060base 7: 6 digits
Nonary40252base 9; each digit is two ternary digits: 5 digits
Duodecimal13385base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal362dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:20:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT00T011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110100111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001100010101011
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes267 55
Gray code101010011111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001100010101011two's complement
32-bit11111111111111111001100010101011two's complement
64-bit1111111111111111111111111111111111111111111111111001100010101011two's complement
One's complement0110011101010100at 16 bits, every bit flipped
Bits reversed1101010100011001at 16 bits
Rotated left by 10011000101010111at 16 bits, wrapping
Shifted left by 1-1100111010101010= -52,906, no wrap
Shifted right by 1-11001110101011= -13,226, discarding the low bit
These bits as a double1.30695185 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-26,453 to the power 2699,761,209
-26,453 to the power 3-18,510,783,261,677
-26,453 to the power 4489,665,749,621,141,681
-26,453 to the power 5-12,953,128,074,728,060,887,493
First ten multiples-26,453, -52,906, -79,359, -105,812, -132,265, -158,718, -185,171, -211,624, -238,077, -264,530
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-2,645,300%
-26,453% as a decimal-264.53
-26,453% of 100-26,453
-26,453% of 1,000-264,530
As a fraction of 100-26,453/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -26,453
Nerdulate something else
Nothing in mind? Surprise me · today’s page