Nerdulator> put something in

Recognised as Number

-12,981,572

  • Negative
  • Even
  • 8 digits

-12,981,572 is an even 8-digit integer and the negative of 12,981,572. It has 12 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value12,981,572
Digit count8
Digit sum35
Digit product10,080
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^2 × 137 × 23,689
Distinct prime factors32, 137, 23,689
Number of divisors12
Sum of divisors σ(n)22,884,540
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 137, 274, 548, 23,689, 47,378, 94,756, 3,245,393, 6,490,786, 12,981,57212 in total

Arithmetic

Previous number-12,981,573
Next number-12,981,571
Cube-2,187,670,241,798,189,661,248
Cube root-235.022312654
Negation12,981,572
Reciprocal-7.70322731 × 10^-8

Representations

Decimal-12,981,572
Binary11000110000101010100010024 bits
Octal61412504
HexadecimalC61544
Base 367Q8N8
In wordsminus twelve million, nine hundred and eighty-one thousand, five hundred and seventy-two
Ordinalminus twelve million, nine hundred and eighty-one thousand, five hundred and seventy-second
Scientific notation-1.2981572 × 10^7
Engineering notation-12.981572 × 10^6

In other bases

Ternary220102112100222base 3; the most digit-efficient integer base after e: 15 digits
Quinary11310402242base 5; one hand: 11 digits
Septenary215225102base 7: 9 digits
Nonary26375328base 9; each digit is two ternary digits: 8 digits
Duodecimal4420598base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal412dicbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:0:5:59:32base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT010TT0111T0T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011100011111111001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001110011110101010111100
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes3c6 15 44
Gray code101001010001111111100110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001110011110101010111100two's complement
64-bit1111111111111111111111111111111111111111001110011110101010111100two's complement
One's complement00000000110001100001010101000011at 32 bits, every bit flipped
Bits reversed00111101010101111001110011111111at 32 bits
Rotated left by 111111110011100111101010101111001at 32 bits, wrapping
Shifted left by 1-1100011000010101010001000= -25,963,144, no wrap
Shifted right by 1-11000110000101010100010= -6,490,786, discarding the low bit
These bits as a double6.41374875 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+12,981,574
Nearest square below12,974,404
Nearest square above12,981,609

Powers & multiples

-12,981,572 to the power 2168,521,211,591,184
-12,981,572 to the power 3-2,187,670,241,798,189,661,248
-12,981,572 to the power 428,399,398,756,160,608,557,146,521,856
-12,981,572 to the power 5-368,668,839,709,809,383,548,413,688,023,237,632
First ten multiples-12,981,572, -25,963,144, -38,944,716, -51,926,288, -64,907,860, -77,889,432, -90,871,004, -103,852,576, -116,834,148, -129,815,720
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,298,157,200%
-12,981,572% as a decimal-129,815.72
-12,981,572% of 100-12,981,572
-12,981,572% of 1,000-129,815,720
As a fraction of 100-12,981,572/100

Keep nerding

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

Also reads as

12981572 (identifier)

  • 8 characters
  • Checksum fails

12981572 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.

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 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

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