Nerdulator> put something in

Recognised as Number

-13,614,989

  • Negative
  • Odd
  • 8 digits

-13,614,989 is an odd 8-digit integer and the negative of 13,614,989. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value13,614,989
Digit count8
Digit sum41
Digit product46,656
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 13,614,989
Distinct prime factors113,614,989
Number of divisors2
Sum of divisors σ(n)13,614,990
SquarefreeYesno repeated prime factor
All divisors1, 13,614,9892 in total

Arithmetic

Previous number-13,614,990
Next number-13,614,988
Cube-2,523,782,266,228,517,243,669
Cube root-238.784297952≈
Negation13,614,989
Reciprocal-7.34484618 × 10^-8≈

Representations

Decimal-13,614,989
Binary11001111101111111000110124 bits
Octal63737615
HexadecimalCFBF8D
Base 3683TE5
In wordsminus thirteen million, six hundred and fourteen thousand, nine hundred and eighty-nine
Ordinalminus thirteen million, six hundred and fourteen thousand, nine hundred and eighty-ninth
Scientific notation-1.3614989 × 10^7
Engineering notation-13.614989 × 10^6

In other bases

Ternary221121201020212base 3; the most digit-efficient integer base after e: 15 digits
Quinary11441134424base 5; one hand: 11 digits
Septenary223503563base 7: 9 digits
Nonary27551225base 9; each digit is two ternary digits: 8 digits
Duodecimal4687065base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal451h99base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:3:1:56:29base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00110110TT1T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100000100000110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001100000100000001110011
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 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
Bytes3cf bf 8d
Gray code101010000110000001001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001100000100000001110011two's complement
64-bit1111111111111111111111111111111111111111001100000100000001110011two's complement
One's complement00000000110011111011111110001100at 32 bits, every bit flipped
Bits reversed11001110000000100000110011111111at 32 bits
Rotated left by 111111110011000001000000011100111at 32 bits, wrapping
Shifted left by 1-1100111110111111100011010= -27,229,978, no wrap
Shifted right by 1-11001111101111111000111= -6,807,494, discarding the low bit
These bits as a double6.72669833 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,614,991
Nearest square below13,608,721
Nearest square above13,616,100

Powers & multiples

-13,614,989 to the power 2185,367,925,470,121
-13,614,989 to the power 3-2,523,782,266,228,517,243,669
-13,614,989 to the power 434,361,267,793,096,333,758,863,754,641
-13,614,989 to the power 5-467,828,283,029,060,860,067,258,671,935,913,949
First ten multiples-13,614,989, -27,229,978, -40,844,967, -54,459,956, -68,074,945, -81,689,934, -95,304,923, -108,919,912, -122,534,901, -136,149,890
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,361,498,900%
-13,614,989% as a decimal-136,149.89
-13,614,989% of 100-13,614,989
-13,614,989% of 1,000-136,149,890
As a fraction of 100-13,614,989/100

Keep nerding

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

Also reads as

13614989 (identifier)

  • 8 characters
  • Checksum fails

13614989 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 “-13614989” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.