Nerdulator> put something in

Recognised as Number

-14,675,321

  • Negative
  • Odd
  • 8 digits

-14,675,321 is an odd 8-digit integer and the negative of 14,675,321. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value14,675,321
Digit count8
Digit sum29
Digit product5,040
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 × 14,675,321
Distinct prime factors114,675,321
Number of divisors2
Sum of divisors σ(n)14,675,322
SquarefreeYesno repeated prime factor
All divisors1, 14,675,3212 in total

Arithmetic

Previous number-14,675,322
Next number-14,675,320
Cube-3,160,551,188,878,288,101,161
Cube root-244.828818366
Negation14,675,321
Reciprocal-6.814161 × 10^-8

Representations

Decimal-14,675,321
Binary11011111111011010111100124 bits
Octal67766571
HexadecimalDFED79
Base 368QJJT
In wordsminus fourteen million, six hundred and seventy-five thousand, three hundred and twenty-one
Ordinalminus fourteen million, six hundred and seventy-five thousand, three hundred and twenty-first
Scientific notation-1.4675321 × 10^7
Engineering notation-14.675321 × 10^6

In other bases

Ternary1000121120202102base 3; the most digit-efficient integer base after e: 16 digits
Quinary12224102241base 5; one hand: 11 digits
Septenary235511123base 7: 9 digits
Nonary30546672base 9; each digit is two ternary digits: 8 digits
Duodecimal4ab87b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4be861base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:7:56:28:41base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00T10111T1T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011000000001011110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001000000001001010000111
Bit length24 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits6within that length
Bit parityeven18 set bits, so even; 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
Bytes3df ed 79
Gray code101100000001101111000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001000000001001010000111two's complement
64-bit1111111111111111111111111111111111111111001000000001001010000111two's complement
One's complement00000000110111111110110101111000at 32 bits, every bit flipped
Bits reversed11100001010010000000010011111111at 32 bits
Rotated left by 111111110010000000010010100001111at 32 bits, wrapping
Shifted left by 1-1101111111101101011110010= -29,350,642, no wrap
Shifted right by 1-11011111111011010111101= -7,337,660, discarding the low bit
These bits as a double7.25057195 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+14,675,323
Nearest square below14,668,900
Nearest square above14,676,561

Powers & multiples

-14,675,321 to the power 2215,365,046,453,041
-14,675,321 to the power 3-3,160,551,188,878,288,101,161
-14,675,321 to the power 446,382,103,233,720,507,815,018,147,681
-14,675,321 to the power 5-680,672,253,609,986,476,468,399,938,044,080,601
First ten multiples-14,675,321, -29,350,642, -44,025,963, -58,701,284, -73,376,605, -88,051,926, -102,727,247, -117,402,568, -132,077,889, -146,753,210
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21

As a percentage & fraction

As a percentage-1,467,532,100%
-14,675,321% as a decimal-146,753.21
-14,675,321% of 100-14,675,321
-14,675,321% of 1,000-146,753,210
As a fraction of 100-14,675,321/100

Keep nerding

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

Also reads as

14675321 (identifier)

  • 8 characters
  • Checksum fails

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