Recognised as Number
-12,737,252
- Negative
- Even
- 8 digits
-12,737,252 is an even 8-digit integer and the negative of 12,737,252. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value12,737,252
Digit count8
Digit sum29
Digit product5,880
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 11 × 337 × 859
Distinct prime factors42, 11, 337, 859
Number of divisors24
Sum of divisors σ(n)24,417,120
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 337, 674, 859, 1,348, 1,718, 3,436, 3,707, 7,414, 9,449, 14,828, 18,898, 37,796, 289,483, 578,966, 1,157,932, 3,184,313, 6,368,626, 12,737,25224 in total
Arithmetic
Previous number-12,737,253
Next number-12,737,251
Double-25,474,504
Half-6,368,626
Square162,237,588,511,504
Cube-2,066,461,048,743,331,347,008
Cube root-233.538550524≈
Negation12,737,252
Reciprocal-7.85098701 × 10^-8≈
Representations
Decimal-12,737,252
Binary11000010010110101110010024 bits
Octal60455344
HexadecimalC25AE4
Base 367L04K
In wordsminus twelve million, seven hundred and thirty-seven thousand, two hundred and fifty-two
Ordinalminus twelve million, seven hundred and thirty-seven thousand, two hundred and fifty-second
Scientific notation-1.2737252 × 10^7
Engineering notation-12.737252 × 10^6
In other bases
Ternary212222010020002base 3; the most digit-efficient integer base after e: 15 digits
Quinary11230043002base 5; one hand: 11 digits
Septenary213156563base 7: 9 digits
Nonary25863202base 9; each digit is two ternary digits: 8 digits
Duodecimal4323118base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal3jc32cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal58:58:7:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT0100010T0T100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000101110010101101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001111011010010100011100
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes3c2 5a e4
Gray code101000110111011110010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001111011010010100011100two's complement
64-bit1111111111111111111111111111111111111111001111011010010100011100two's complement
One's complement00000000110000100101101011100011at 32 bits, every bit flipped
Bits reversed00111000101001011011110011111111at 32 bits
Rotated left by 111111110011110110100101000111001at 32 bits, wrapping
Shifted left by 1-1100001001011010111001000= -25,474,504, no wrap
Shifted right by 1-11000010010110101110010= -6,368,626, discarding the low bit
These bits as a double6.29303864 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-12,737,252 to the power 2162,237,588,511,504
-12,737,252 to the power 3-2,066,461,048,743,331,347,008
-12,737,252 to the power 426,321,035,126,028,094,686,340,342,016
-12,737,252 to the power 5-335,257,657,301,071,601,099,777,894,023,980,032
First ten multiples-12,737,252, -25,474,504, -38,211,756, -50,949,008, -63,686,260, -76,423,512, -89,160,764, -101,898,016, -114,635,268, -127,372,520
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 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52
As a percentage & fraction
As a percentage-1,273,725,200%
-12,737,252% as a decimal-127,372.52
-12,737,252% of 100-12,737,252
-12,737,252% of 1,000-127,372,520
As a fraction of 100-12,737,252/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -12,737,252
Also reads as
12737252 (identifier)
- 8 characters
- Checksum fails
12737252 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