Nerdulator> put something in

Recognised as Number

-10,420,169

  • Negative
  • Odd
  • 8 digits

-10,420,169 is an odd 8-digit integer and the negative of 10,420,169. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,420,169
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 10,420,169
Distinct prime factors110,420,169
Number of divisors2
Sum of divisors σ(n)10,420,170
SquarefreeYesno repeated prime factor
All divisors1, 10,420,1692 in total

Arithmetic

Previous number-10,420,170
Next number-10,420,168
Cube-1,131,421,137,127,621,686,809
Cube root-218.419590001
Negation10,420,169
Reciprocal-9.59677333 × 10^-8

Representations

Decimal-10,420,169
Binary10011110111111111100100124 bits
Octal47577711
Hexadecimal9EFFC9
Base 3667C95
In wordsminus ten million, four hundred and twenty thousand, one hundred and sixty-nine
Ordinalminus ten million, four hundred and twenty thousand, one hundred and sixty-ninth
Scientific notation-1.0420169 × 10^7
Engineering notation-10.420169 × 10^6

In other bases

Ternary201121101210012base 3; the most digit-efficient integer base after e: 15 digits
Quinary10131421134base 5; one hand: 11 digits
Septenary154366334base 7: 9 digits
Nonary21541705base 9; each digit is two ternary digits: 8 digits
Duodecimal35a6235base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal352a89base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal48:14:29:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T111TTT11T0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000010000000001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011000010000000000110111
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 set bits, so odd; 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 c9
Gray code110100011000000000101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011000010000000000110111two's complement
64-bit1111111111111111111111111111111111111111011000010000000000110111two's complement
One's complement00000000100111101111111111001000at 32 bits, every bit flipped
Bits reversed11101100000000001000011011111111at 32 bits
Rotated left by 111111110110000100000000001101111at 32 bits, wrapping
Shifted left by 1-1001111011111111110010010= -20,840,338, no wrap
Shifted right by 1-10011110111111111100101= -5,210,084, discarding the low bit
These bits as a double5.14824753 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,420,171
Nearest square below10,419,984
Nearest square above10,426,441

Powers & multiples

-10,420,169 to the power 2108,579,921,988,561
-10,420,169 to the power 3-1,131,421,137,127,621,686,809
-10,420,169 to the power 411,789,599,459,041,992,544,614,850,721
-10,420,169 to the power 5-122,849,618,805,526,140,411,626,784,422,591,849
First ten multiples-10,420,169, -20,840,338, -31,260,507, -41,680,676, -52,100,845, -62,521,014, -72,941,183, -83,361,352, -93,781,521, -104,201,690
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69

As a percentage & fraction

As a percentage-1,042,016,900%
-10,420,169% as a decimal-104,201.69
-10,420,169% of 100-10,420,169
-10,420,169% of 1,000-104,201,690
As a fraction of 100-10,420,169/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

10420169 (identifier)

  • 8 characters
  • Checksum valid

10420169 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for ISSN. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

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 validmod 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

Every value on this page was computed from “-10420169” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.