Recognised as Number
-10,420,167
- Negative
- Odd
- 8 digits
-10,420,167 is an odd 8-digit integer and the negative of 10,420,167. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,420,167
Digit count8
Digit sum21
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 × 17 × 59 × 3,463
Distinct prime factors43, 17, 59, 3,463
Number of divisors16
Sum of divisors σ(n)14,964,480
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 59, 177, 1,003, 3,009, 3,463, 10,389, 58,871, 176,613, 204,317, 612,951, 3,473,389, 10,420,16716 in total
Arithmetic
Previous number-10,420,168
Next number-10,420,166
Double-20,840,334
Half-5,210,083.5
Square108,579,880,307,889
Cube-1,131,420,485,648,214,797,463
Cube root-218.419576027≈
Negation10,420,167
Reciprocal-9.59677518 × 10^-8≈
Representations
Decimal-10,420,167
Binary10011110111111111100011124 bits
Octal47577707
Hexadecimal9EFFC7
Base 3667C93
In wordsminus ten million, four hundred and twenty thousand, one hundred and sixty-seven
Ordinalminus ten million, four hundred and twenty thousand, one hundred and sixty-seventh
Scientific notation-1.0420167 × 10^7
Engineering notation-10.420167 × 10^6
In other bases
Ternary201121101210010base 3; the most digit-efficient integer base after e: 15 digits
Quinary10131421132base 5; one hand: 11 digits
Septenary154366332base 7: 9 digits
Nonary21541703base 9; each digit is two ternary digits: 8 digits
Duodecimal35a6233base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal352a87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal48:14:29:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T111TTT11T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000010000000001001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011000010000000000111001
Bit length24 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits6within that length
Bit parityeven18 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes39e ff c7
Gray code110100011000000000100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011000010000000000111001two's complement
64-bit1111111111111111111111111111111111111111011000010000000000111001two's complement
One's complement00000000100111101111111111000110at 32 bits, every bit flipped
Bits reversed10011100000000001000011011111111at 32 bits
Rotated left by 111111110110000100000000001110011at 32 bits, wrapping
Shifted left by 1-1001111011111111110001110= -20,840,334, no wrap
Shifted right by 1-10011110111111111100100= -5,210,083, discarding the low bit
These bits as a double5.14824654 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,420,167 to the power 2108,579,880,307,889
-10,420,167 to the power 3-1,131,420,485,648,214,797,463
-10,420,167 to the power 411,789,590,407,675,501,441,435,636,321
-10,420,167 to the power 5-122,849,500,909,576,806,828,500,050,216,085,607
First ten multiples-10,420,167, -20,840,334, -31,260,501, -41,680,668, -52,100,835, -62,521,002, -72,941,169, -83,361,336, -93,781,503, -104,201,670
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-1,042,016,700%
-10,420,167% as a decimal-104,201.67
-10,420,167% of 100-10,420,167
-10,420,167% of 1,000-104,201,670
As a fraction of 100-10,420,167/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -10,420,167
Also reads as
10420167 (identifier)
- 8 characters
- Checksum fails
10420167 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page