Recognised as Number
-13,080,975
- Negative
- Odd
- 8 digits
-13,080,975 is an odd 8-digit integer and the negative of 13,080,975. It has 12 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,080,975
Digit count8
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5^2 × 174,413
Distinct prime factors33, 5, 174,413
Number of divisors12
Sum of divisors σ(n)21,627,336
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 75, 174,413, 523,239, 872,065, 2,616,195, 4,360,325, 13,080,97512 in total
Arithmetic
Previous number-13,080,976
Next number-13,080,974
Double-26,161,950
Half-6,540,487.5
Square171,111,906,950,625
Cube-2,238,310,577,023,451,859,375
Cube root-235.620662018≈
Negation13,080,975
Reciprocal-7.64469009 × 10^-8≈
Representations
Decimal-13,080,975
Binary11000111100110011000111124 bits
Octal61714617
HexadecimalC7998F
Base 367SDCF
In wordsminus thirteen million, eighty thousand, nine hundred and seventy-five
Ordinalminus thirteen million, eighty thousand, nine hundred and seventy-fifth
Scientific notation-1.3080975 × 10^7
Engineering notation-13.080975 × 10^6
In other bases
Ternary220121120201120base 3; the most digit-efficient integer base after e: 15 digits
Quinary11322042400base 5; one hand: 11 digits
Septenary216120645base 7: 9 digits
Nonary26546646base 9; each digit is two ternary digits: 8 digits
Duodecimal446a013base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal41f28fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:0:33:36:15base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T10111T1T1110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010011011101110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001110000110011001110001
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 set bits, so even; 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 99 8f
Gray code101001000101010101001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001110000110011001110001two's complement
64-bit1111111111111111111111111111111111111111001110000110011001110001two's complement
One's complement00000000110001111001100110001110at 32 bits, every bit flipped
Bits reversed10001110011001100001110011111111at 32 bits
Rotated left by 111111110011100001100110011100011at 32 bits, wrapping
Shifted left by 1-1100011110011001100011110= -26,161,950, no wrap
Shifted right by 1-11000111100110011001000= -6,540,487, discarding the low bit
These bits as a double6.46286036 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,080,975 to the power 2171,111,906,950,625
-13,080,975 to the power 3-2,238,310,577,023,451,859,375
-13,080,975 to the power 429,279,284,700,279,348,186,187,890,625
-13,080,975 to the power 5-383,001,591,182,236,646,639,819,142,568,359,375
First ten multiples-13,080,975, -26,161,950, -39,242,925, -52,323,900, -65,404,875, -78,485,850, -91,566,825, -104,647,800, -117,728,775, -130,809,750
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 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-1,308,097,500%
-13,080,975% as a decimal-130,809.75
-13,080,975% of 100-13,080,975
-13,080,975% of 1,000-130,809,750
As a fraction of 100-13,080,975/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,080,975
Also reads as
13080975 (identifier)
- 8 characters
- Checksum fails
13080975 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