Recognised as Number
-23,007
- Negative
- Odd
- 5 digits
-23,007 is an odd 5-digit integer and the negative of 23,007. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value23,007
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7,669
Distinct prime factors23, 7,669
Number of divisors4
Sum of divisors σ(n)30,680
SquarefreeYesno repeated prime factor
All divisors1, 3, 7,669, 23,0074 in total
Arithmetic
Representations
Decimal-23,007
Binary10110011101111115 bits
Octal54737
Hexadecimal59DF
Base 36HR3
In wordsminus twenty-three thousand and seven
Ordinalminus twenty-three thousand and seventh
Scientific notation-2.3007 × 10^4
Engineering notation-23.007 × 10^3
In other bases
Ternary1011120010base 3; the most digit-efficient integer base after e: 10 digits
Quinary1214012base 5; one hand: 7 digits
Septenary124035base 7: 6 digits
Nonary34503base 9; each digit is two ternary digits: 5 digits
Duodecimal11393base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2ha7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:23:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT111100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010011000100001
Bit length15 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits4within that length
Bit parityodd11 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
Bytes259 df
Gray code111010100110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010011000100001two's complement
32-bit11111111111111111010011000100001two's complement
64-bit1111111111111111111111111111111111111111111111111010011000100001two's complement
One's complement0101100111011110at 16 bits, every bit flipped
Bits reversed1000010001100101at 16 bits
Rotated left by 10100110001000011at 16 bits, wrapping
Shifted left by 1-1011001110111110= -46,014, no wrap
Shifted right by 1-10110011110000= -11,503, discarding the low bit
These bits as a double1.13669683 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-23,007 to the power 2529,322,049
-23,007 to the power 3-12,178,112,381,343
-23,007 to the power 4280,181,831,557,558,401
-23,007 to the power 5-6,446,143,398,644,746,131,807
First ten multiples-23,007, -46,014, -69,021, -92,028, -115,035, -138,042, -161,049, -184,056, -207,063, -230,070
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-2,300,700%
-23,007% as a decimal-230.07
-23,007% of 100-23,007
-23,007% of 1,000-230,070
As a fraction of 100-23,007/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -23,007
Nerdulate something else
Nothing in mind? Surprise me · today’s page