Recognised as Number
-13,091,971
- Negative
- Odd
- 8 digits
-13,091,971 is an odd 8-digit integer and the negative of 13,091,971. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,091,971
Digit count8
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13,091,971
Distinct prime factors113,091,971
Number of divisors2
Sum of divisors σ(n)13,091,972
SquarefreeYesno repeated prime factor
All divisors1, 13,091,9712 in total
Arithmetic
Previous number-13,091,972
Next number-13,091,970
Double-26,183,942
Half-6,545,985.5
Square171,399,704,664,841
Cube-2,243,959,962,880,663,091,611
Cube root-235.686665232≈
Negation13,091,971
Reciprocal-7.63826929 × 10^-8≈
Representations
Decimal-13,091,971
Binary11000111110001001000001124 bits
Octal61742203
HexadecimalC7C483
Base 367SLTV
In wordsminus thirteen million, ninety-one thousand, nine hundred and seventy-one
Ordinalminus thirteen million, ninety-one thousand, nine hundred and seventy-first
Scientific notation-1.3091971 × 10^7
Engineering notation-13.091971 × 10^6
In other bases
Ternary220122010210211base 3; the most digit-efficient integer base after e: 15 digits
Quinary11322420341base 5; one hand: 11 digits
Septenary216165004base 7: 9 digits
Nonary26563724base 9; each digit is two ternary digits: 8 digits
Duodecimal4474457base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal41g9ibbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:0:36:39:31base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T1010TT1TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010000100110010001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001110000011101101111101
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 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
Bytes3c7 c4 83
Gray code101001000010011011000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001110000011101101111101two's complement
64-bit1111111111111111111111111111111111111111001110000011101101111101two's complement
One's complement00000000110001111100010010000010at 32 bits, every bit flipped
Bits reversed10111110110111000001110011111111at 32 bits
Rotated left by 111111110011100000111011011111011at 32 bits, wrapping
Shifted left by 1-1100011111000100100000110= -26,183,942, no wrap
Shifted right by 1-11000111110001001000010= -6,545,985, discarding the low bit
These bits as a double6.46829311 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,091,971 to the power 2171,399,704,664,841
-13,091,971 to the power 3-2,243,959,962,880,663,091,611
-13,091,971 to the power 429,377,858,759,194,717,656,141,555,281
-13,091,971 to the power 5-384,614,074,917,473,226,907,393,213,633,748,851
First ten multiples-13,091,971, -26,183,942, -39,275,913, -52,367,884, -65,459,855, -78,551,826, -91,643,797, -104,735,768, -117,827,739, -130,919,710
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-1,309,197,100%
-13,091,971% as a decimal-130,919.71
-13,091,971% of 100-13,091,971
-13,091,971% of 1,000-130,919,710
As a fraction of 100-13,091,971/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -13,091,971
Also reads as
13091971 (identifier)
- 8 characters
- Checksum fails
13091971 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