Recognised as Number
-16,710,137
- Negative
- Odd
- 8 digits
-16,710,137 is an odd 8-digit integer and the negative of 16,710,137. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,710,137
Digit count8
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,169 × 5,273
Distinct prime factors23,169, 5,273
Number of divisors4
Sum of divisors σ(n)16,718,580
SquarefreeYesno repeated prime factor
All divisors1, 3,169, 5,273, 16,710,1374 in total
Arithmetic
Previous number-16,710,138
Next number-16,710,136
Double-33,420,274
Half-8,355,068.5
Square279,228,678,558,769
Cube-4,665,949,473,045,992,541,353
Cube root-255.658362844≈
Negation16,710,137
Reciprocal-5.98439139 × 10^-8≈
Representations
Decimal-16,710,137
Binary11111110111110011111100124 bits
Octal77574771
HexadecimalFEF9F9
Base 369Y5MH
In wordsminus sixteen million, seven hundred and ten thousand, one hundred and thirty-seven
Ordinalminus sixteen million, seven hundred and ten thousand, one hundred and thirty-seventh
Scientific notation-1.6710137 × 10^7
Engineering notation-16.710137 × 10^6
In other bases
Ternary1011102221222222base 3; the most digit-efficient integer base after e: 16 digits
Quinary13234211022base 5; one hand: 11 digits
Septenary262014413base 7: 9 digits
Nonary34387888base 9; each digit is two ternary digits: 8 digits
Duodecimal571a275base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal548f6hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:17:21:42:17base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0TTTT0001000001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000010001101000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000000010000011000000111
Bit length24 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits5within that length
Bit parityodd19 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
Bytes3fe f9 f9
Gray code100000011000010100000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000000010000011000000111two's complement
64-bit1111111111111111111111111111111111111111000000010000011000000111two's complement
One's complement00000000111111101111100111111000at 32 bits, every bit flipped
Bits reversed11100000011000001000000011111111at 32 bits
Rotated left by 111111110000000100000110000001111at 32 bits, wrapping
Shifted left by 1-1111111011111001111110010= -33,420,274, no wrap
Shifted right by 1-11111110111110011111101= -8,355,068, discarding the low bit
These bits as a double8.25590463 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,710,137 to the power 2279,228,678,558,769
-16,710,137 to the power 3-4,665,949,473,045,992,541,353
-16,710,137 to the power 477,968,654,929,676,342,666,986,795,361
-16,710,137 to the power 5-1,302,866,905,580,617,051,624,294,727,673,274,457
First ten multiples-16,710,137, -33,420,274, -50,130,411, -66,840,548, -83,550,685, -100,260,822, -116,970,959, -133,681,096, -150,391,233, -167,101,370
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-1,671,013,700%
-16,710,137% as a decimal-167,101.37
-16,710,137% of 100-16,710,137
-16,710,137% of 1,000-167,101,370
As a fraction of 100-16,710,137/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,710,137
Also reads as
16710137 (identifier)
- 8 characters
- Checksum fails
16710137 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