Nerdulator> put something in

Recognised as Number

-12,925,713

  • Negative
  • Odd
  • 8 digits

-12,925,713 is an odd 8-digit integer and the negative of 12,925,713. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value12,925,713
Digit count8
Digit sum30
Digit product3,780
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 4,308,571
Distinct prime factors23, 4,308,571
Number of divisors4
Sum of divisors σ(n)17,234,288
SquarefreeYesno repeated prime factor
All divisors1, 3, 4,308,571, 12,925,7134 in total

Arithmetic

Previous number-12,925,714
Next number-12,925,712
Cube-2,159,551,304,819,245,442,097
Cube root-234.684731906≈
Negation12,925,713
Reciprocal-7.73651713 × 10^-8≈

Representations

Decimal-12,925,713
Binary11000101001110110001000124 bits
Octal61235421
HexadecimalC53B11
Base 367P1JL
In wordsminus twelve million, nine hundred and twenty-five thousand, seven hundred and thirteen
Ordinalminus twelve million, nine hundred and twenty-five thousand, seven hundred and thirteenth
Scientific notation-1.2925713 × 10^7
Engineering notation-12.925713 × 10^6

In other bases

Ternary220022200202010base 3; the most digit-efficient integer base after e: 15 digits
Quinary11302110323base 5; one hand: 11 digits
Septenary214603203base 7: 9 digits
Nonary26280663base 9; each digit is two ternary digits: 8 digits
Duodecimal43b41a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal40fe5dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal59:50:28:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT010T0010T1T10T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011111100010100110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001110101100010011101111
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
Bytes3c5 3b 11
Gray code101001111010011010011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001110101100010011101111two's complement
64-bit1111111111111111111111111111111111111111001110101100010011101111two's complement
One's complement00000000110001010011101100010000at 32 bits, every bit flipped
Bits reversed11110111001000110101110011111111at 32 bits
Rotated left by 111111110011101011000100111011111at 32 bits, wrapping
Shifted left by 1-1100010100111011000100010= -25,851,426, no wrap
Shifted right by 1-11000101001110110001001= -6,462,856, discarding the low bit
These bits as a double6.38615074 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+12,925,715
Nearest square below12,924,025
Nearest square above12,931,216

Powers & multiples

-12,925,713 to the power 2167,074,056,558,369
-12,925,713 to the power 3-2,159,551,304,819,245,442,097
-12,925,713 to the power 427,913,740,374,869,083,461,103,940,161
-12,925,713 to the power 5-360,804,996,842,070,185,391,276,193,690,259,793
First ten multiples-12,925,713, -25,851,426, -38,777,139, -51,702,852, -64,628,565, -77,554,278, -90,479,991, -103,405,704, -116,331,417, -129,257,130
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 13

As a percentage & fraction

As a percentage-1,292,571,300%
-12,925,713% as a decimal-129,257.13
-12,925,713% of 100-12,925,713
-12,925,713% of 1,000-129,257,130
As a fraction of 100-12,925,713/100

Keep nerding

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

Also reads as

12925713 (identifier)

  • 8 characters
  • Checksum valid

12925713 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for ISSN. 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 validmod 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 “-12925713” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.