Recognised as Number
-23,041
- Negative
- Odd
- 5 digits
-23,041 is an odd 5-digit integer and the negative of 23,041. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value23,041
Digit count5
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23,041
Distinct prime factors123,041
Number of divisors2
Sum of divisors σ(n)23,042
SquarefreeYesno repeated prime factor
All divisors1, 23,0412 in total
Arithmetic
Representations
Decimal-23,041
Binary10110100000000115 bits
Octal55001
Hexadecimal5A01
Base 36HS1
In wordsminus twenty-three thousand and forty-one
Ordinalminus twenty-three thousand and forty-first
Scientific notation-2.3041 × 10^4
Engineering notation-23.041 × 10^3
In other bases
Ternary1011121101base 3; the most digit-efficient integer base after e: 10 digits
Quinary1214131base 5; one hand: 7 digits
Septenary124114base 7: 6 digits
Nonary34541base 9; each digit is two ternary digits: 5 digits
Duodecimal11401base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2hc1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:24:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT1111TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010010111111111
Bit length15 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits10within that length
Bit parityodd5 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
Bytes25a 01
Gray code111011100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010010111111111two's complement
32-bit11111111111111111010010111111111two's complement
64-bit1111111111111111111111111111111111111111111111111010010111111111two's complement
One's complement0101101000000000at 16 bits, every bit flipped
Bits reversed1111111110100101at 16 bits
Rotated left by 10100101111111111at 16 bits, wrapping
Shifted left by 1-1011010000000010= -46,082, no wrap
Shifted right by 1-10110100000001= -11,520, discarding the low bit
These bits as a double1.13837665 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-23,041 to the power 2530,887,681
-23,041 to the power 3-12,232,183,057,921
-23,041 to the power 4281,841,729,837,557,761
-23,041 to the power 5-6,493,915,297,187,168,371,201
First ten multiples-23,041, -46,082, -69,123, -92,164, -115,205, -138,246, -161,287, -184,328, -207,369, -230,410
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-2,304,100%
-23,041% as a decimal-230.41
-23,041% of 100-23,041
-23,041% of 1,000-230,410
As a fraction of 100-23,041/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -23,041
Nerdulate something else
Nothing in mind? Surprise me · today’s page