Recognised as Number
-16,003,197
- Negative
- Odd
- 8 digits
-16,003,197 is an odd 8-digit integer and the negative of 16,003,197. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,003,197
Digit count8
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 7 × 84,673
Distinct prime factors33, 7, 84,673
Number of divisors16
Sum of divisors σ(n)27,095,680
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 63, 189, 84,673, 254,019, 592,711, 762,057, 1,778,133, 2,286,171, 5,334,399, 16,003,19716 in total
Arithmetic
Previous number-16,003,198
Next number-16,003,196
Double-32,006,394
Half-8,001,598.5
Square256,102,314,220,809
Cube-4,098,455,786,631,507,926,373
Cube root-252.00099206≈
Negation16,003,197
Reciprocal-6.24875142 × 10^-8≈
Representations
Decimal-16,003,197
Binary11110100001100000111110124 bits
Octal75030175
HexadecimalF4307D
Base 369J059
In wordsminus sixteen million, three thousand, one hundred and ninety-seven
Ordinalminus sixteen million, three thousand, one hundred and ninety-seventh
Scientific notation-1.6003197 × 10^7
Engineering notation-16.003197 × 10^6
In other bases
Ternary1010010001021000base 3; the most digit-efficient integer base after e: 16 digits
Quinary13044100242base 5; one hand: 11 digits
Septenary253011360base 7: 9 digits
Nonary33101230base 9; each digit is two ternary digits: 8 digits
Duodecimal5439139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal5007jhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:14:5:19:57base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0T00T000TT1T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111001101000010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000010111100111110000011
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes3f4 30 7d
Gray code100011100010100001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000010111100111110000011two's complement
64-bit1111111111111111111111111111111111111111000010111100111110000011two's complement
One's complement00000000111101000011000001111100at 32 bits, every bit flipped
Bits reversed11000001111100111101000011111111at 32 bits
Rotated left by 111111110000101111001111100000111at 32 bits, wrapping
Shifted left by 1-1111010000110000011111010= -32,006,394, no wrap
Shifted right by 1-11110100001100000111111= -8,001,598, discarding the low bit
These bits as a double7.90662986 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,003,197 to the power 2256,102,314,220,809
-16,003,197 to the power 3-4,098,455,786,631,507,926,373
-16,003,197 to the power 465,588,395,349,253,987,752,808,614,481
-16,003,197 to the power 5-1,049,624,011,687,995,369,043,783,560,836,495,757
First ten multiples-16,003,197, -32,006,394, -48,009,591, -64,012,788, -80,015,985, -96,019,182, -112,022,379, -128,025,576, -144,028,773, -160,031,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-1,600,319,700%
-16,003,197% as a decimal-160,031.97
-16,003,197% of 100-16,003,197
-16,003,197% of 1,000-160,031,970
As a fraction of 100-16,003,197/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -16,003,197
Also reads as
16003197 (identifier)
- 8 characters
- Checksum fails
16003197 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