Recognised as Number
-23,501
- Negative
- Odd
- 5 digits
-23,501 is an odd 5-digit integer and the negative of 23,501. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value23,501
Digit count5
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 71 × 331
Distinct prime factors271, 331
Number of divisors4
Sum of divisors σ(n)23,904
SquarefreeYesno repeated prime factor
All divisors1, 71, 331, 23,5014 in total
Arithmetic
Representations
Decimal-23,501
Binary10110111100110115 bits
Octal55715
Hexadecimal5BCD
Base 36I4T
In wordsminus twenty-three thousand, five hundred and one
Ordinalminus twenty-three thousand, five hundred and first
Scientific notation-2.3501 × 10^4
Engineering notation-23.501 × 10^3
In other bases
Ternary1012020102base 3; the most digit-efficient integer base after e: 10 digits
Quinary1223001base 5; one hand: 7 digits
Septenary125342base 7: 6 digits
Nonary35212base 9; each digit is two ternary digits: 5 digits
Duodecimal11725base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2if1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:31:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT11T10TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110010001110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010010000110011
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes25b cd
Gray code111011000101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010010000110011two's complement
32-bit11111111111111111010010000110011two's complement
64-bit1111111111111111111111111111111111111111111111111010010000110011two's complement
One's complement0101101111001100at 16 bits, every bit flipped
Bits reversed1100110000100101at 16 bits
Rotated left by 10100100001100111at 16 bits, wrapping
Shifted left by 1-1011011110011010= -47,002, no wrap
Shifted right by 1-10110111100111= -11,750, discarding the low bit
These bits as a double1.16110367 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-23,501 to the power 2552,297,001
-23,501 to the power 3-12,979,531,820,501
-23,501 to the power 4305,031,977,313,594,001
-23,501 to the power 5-7,168,556,498,846,772,617,501
First ten multiples-23,501, -47,002, -70,503, -94,004, -117,505, -141,006, -164,507, -188,008, -211,509, -235,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-2,350,100%
-23,501% as a decimal-235.01
-23,501% of 100-23,501
-23,501% of 1,000-235,010
As a fraction of 100-23,501/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -23,501
Nerdulate something else
Nothing in mind? Surprise me · today’s page