Recognised as Number
-13,745,487
- Negative
- Odd
- 8 digits
-13,745,487 is an odd 8-digit integer and the negative of 13,745,487. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,745,487
Digit count8
Digit sum39
Digit product94,080
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 × 7 × 383 × 1,709
Distinct prime factors43, 7, 383, 1,709
Number of divisors16
Sum of divisors σ(n)21,012,480
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 383, 1,149, 1,709, 2,681, 5,127, 8,043, 11,963, 35,889, 654,547, 1,963,641, 4,581,829, 13,745,48716 in total
Arithmetic
Previous number-13,745,488
Next number-13,745,486
Double-27,490,974
Half-6,872,743.5
Square188,938,412,867,169
Cube-2,597,050,497,866,304,216,303
Cube root-239.544779466≈
Negation13,745,487
Reciprocal-7.2751151 × 10^-8≈
Representations
Decimal-13,745,487
Binary11010001101111010100111124 bits
Octal64336517
HexadecimalD1BD4F
Base 3686M33
In wordsminus thirteen million, seven hundred and forty-five thousand, four hundred and eighty-seven
Ordinalminus thirteen million, seven hundred and forty-five thousand, four hundred and eighty-seventh
Scientific notation-1.3745487 × 10^7
Engineering notation-13.745487 × 10^6
In other bases
Ternary221212100021010base 3; the most digit-efficient integer base after e: 15 digits
Quinary12004323422base 5; one hand: 11 digits
Septenary224556210base 7: 9 digits
Nonary27770233base 9; each digit is two ternary digits: 8 digits
Duodecimal472a693base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal45i3e7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:3:38:11:27base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT001011T00T1T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100100100011111110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001011100100001010110001
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes3d1 bd 4f
Gray code101110010110001111101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001011100100001010110001two's complement
64-bit1111111111111111111111111111111111111111001011100100001010110001two's complement
One's complement00000000110100011011110101001110at 32 bits, every bit flipped
Bits reversed10001101010000100111010011111111at 32 bits
Rotated left by 111111110010111001000010101100011at 32 bits, wrapping
Shifted left by 1-1101000110111101010011110= -27,490,974, no wrap
Shifted right by 1-11010001101111010101000= -6,872,743, discarding the low bit
These bits as a double6.79117291 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,745,487 to the power 2188,938,412,867,169
-13,745,487 to the power 3-2,597,050,497,866,304,216,303
-13,745,487 to the power 435,697,723,856,764,812,343,238,074,561
-13,745,487 to the power 5-490,682,599,202,750,590,121,418,491,783,256,207
First ten multiples-13,745,487, -27,490,974, -41,236,461, -54,981,948, -68,727,435, -82,472,922, -96,218,409, -109,963,896, -123,709,383, -137,454,870
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 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 87
As a percentage & fraction
As a percentage-1,374,548,700%
-13,745,487% as a decimal-137,454.87
-13,745,487% of 100-13,745,487
-13,745,487% of 1,000-137,454,870
As a fraction of 100-13,745,487/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,745,487
Also reads as
13745487 (identifier)
- 8 characters
- Checksum fails
13745487 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