Nerdulator> put something in

Recognised as Number

-16,773,370

  • Negative
  • Even
  • 8 digits

-16,773,370 is an even 8-digit integer and the negative of 16,773,370. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value16,773,370
Digit count8
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 5 × 1,677,337
Distinct prime factors32, 5, 1,677,337
Number of divisors8
Sum of divisors σ(n)30,192,084
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 1,677,337, 3,354,674, 8,386,685, 16,773,3708 in total

Arithmetic

Previous number-16,773,371
Next number-16,773,369
Cube-4,719,119,569,022,911,753,000
Cube root-255.980436737
Negation16,773,370
Reciprocal-5.96183116 × 10^-8

Representations

Decimal-16,773,370
Binary11111111111100001111101024 bits
Octal77770372
HexadecimalFFF0FA
Base 369ZIEY
In wordsminus sixteen million, seven hundred and seventy-three thousand, three hundred and seventy
Ordinalminus sixteen million, seven hundred and seventy-three thousand, three hundred and seventieth
Scientific notation-1.677337 × 10^7
Engineering notation-16.77337 × 10^6

In other bases

Ternary1011120011201221base 3; the most digit-efficient integer base after e: 16 digits
Quinary13243221440base 5; one hand: 11 digits
Septenary262366645base 7: 9 digits
Nonary34504657base 9; each digit is two ternary digits: 8 digits
Duodecimal574a98abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal54gd8abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:17:39:16:10base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryTT11110T111T101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000000001001100011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111000000000000111100000110
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes3ff f0 fa
Gray code100000000000100010000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111000000000000111100000110two's complement
64-bit1111111111111111111111111111111111111111000000000000111100000110two's complement
One's complement00000000111111111111000011111001at 32 bits, every bit flipped
Bits reversed01100000111100000000000011111111at 32 bits
Rotated left by 111111110000000000001111000001101at 32 bits, wrapping
Shifted left by 1-1111111111110000111110100= -33,546,740, no wrap
Shifted right by 1-11111111111100001111101= -8,386,685, discarding the low bit
These bits as a double8.28714588 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+16,773,372
Nearest square below16,769,025
Nearest square above16,777,216

Powers & multiples

-16,773,370 to the power 2281,345,941,156,900
-16,773,370 to the power 3-4,719,119,569,022,911,753,000
-16,773,370 to the power 479,155,538,605,461,837,310,417,610,000
-16,773,370 to the power 5-1,327,705,136,578,695,418,087,439,427,045,700,000
First ten multiples-16,773,370, -33,546,740, -50,320,110, -67,093,480, -83,866,850, -100,640,220, -117,413,590, -134,186,960, -150,960,330, -167,733,700
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,677,337,000%
-16,773,370% as a decimal-167,733.7
-16,773,370% of 100-16,773,370
-16,773,370% of 1,000-167,733,700
As a fraction of 100-16,773,370/100

Keep nerding

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

Also reads as

16773370 (identifier)

  • 8 characters
  • Checksum valid

16773370 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for GTIN-8 (EAN-8). 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 validGS1 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

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