Recognised as Number
-10,407
- Negative
- Odd
- 5 digits
-10,407 is an odd 5-digit integer and the negative of 10,407. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,407
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 × 3,469
Distinct prime factors23, 3,469
Number of divisors4
Sum of divisors σ(n)13,880
SquarefreeYesno repeated prime factor
All divisors1, 3, 3,469, 10,4074 in total
Arithmetic
Representations
Decimal-10,407
Binary1010001010011114 bits
Octal24247
Hexadecimal28A7
Base 36813
In wordsminus ten thousand, four hundred and seven
Ordinalminus ten thousand, four hundred and seventh
Scientific notation-1.0407 × 10^4
Engineering notation-10.407 × 10^3
In other bases
Ternary112021110base 3; the most digit-efficient integer base after e: 9 digits
Quinary313112base 5; one hand: 6 digits
Septenary42225base 7: 5 digits
Nonary15243base 9; each digit is two ternary digits: 5 digits
Duodecimal6033base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1607base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:53:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT111T1TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101011101011001
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes228 a7
Gray code11110011110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101011101011001two's complement
32-bit11111111111111111101011101011001two's complement
64-bit1111111111111111111111111111111111111111111111111101011101011001two's complement
One's complement0010100010100110at 16 bits, every bit flipped
Bits reversed1001101011101011at 16 bits
Rotated left by 11010111010110011at 16 bits, wrapping
Shifted left by 1-101000101001110= -20,814, no wrap
Shifted right by 1-1010001010100= -5,203, discarding the low bit
These bits as a double5.14174118 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10,407 to the power 2108,305,649
-10,407 to the power 3-1,127,136,889,143
-10,407 to the power 411,730,113,605,311,201
-10,407 to the power 5-122,075,292,290,473,668,807
First ten multiples-10,407, -20,814, -31,221, -41,628, -52,035, -62,442, -72,849, -83,256, -93,663, -104,070
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 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 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-1,040,700%
-10,407% as a decimal-104.07
-10,407% of 100-10,407
-10,407% of 1,000-104,070
As a fraction of 100-10,407/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10,407
Nerdulate something else
Nothing in mind? Surprise me · today’s page