Nerdulator> put something in

Recognised as Number

-14,038,713

  • Negative
  • Odd
  • 8 digits

-14,038,713 is an odd 8-digit integer and the negative of 14,038,713. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value14,038,713
Digit count8
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3^2 × 13 × 97 × 1,237
Distinct prime factors43, 13, 97, 1,237
Number of divisors24
Sum of divisors σ(n)22,080,968
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 39, 97, 117, 291, 873, 1,237, 1,261, 3,711, 3,783, 11,133, 11,349, 16,081, 48,243, 119,989, 144,729, 359,967, 1,079,901, 1,559,857, 4,679,571, 14,038,71324 in total

Arithmetic

Previous number-14,038,714
Next number-14,038,712
Cube-2,766,826,247,266,530,533,097
Cube root-241.23617396
Negation14,038,713
Reciprocal-7.12316008 × 10^-8

Representations

Decimal-14,038,713
Binary11010110001101101011100124 bits
Octal65433271
HexadecimalD636B9
Base 368CWC9
In wordsminus fourteen million, thirty-eight thousand, seven hundred and thirteen
Ordinalminus fourteen million, thirty-eight thousand, seven hundred and thirteenth
Scientific notation-1.4038713 × 10^7
Engineering notation-14.038713 × 10^6

In other bases

Ternary222102020111100base 3; the most digit-efficient integer base after e: 15 digits
Quinary12043214323base 5; one hand: 11 digits
Septenary230220123base 7: 9 digits
Nonary28366440base 9; each digit is two ternary digits: 8 digits
Duodecimal4850309base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal47egfdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:4:59:38:33base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT001TT1T10TTTT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111101101100101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001010011100100101000111
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 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
Bytes3d6 36 b9
Gray code101111010010110111100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001010011100100101000111two's complement
64-bit1111111111111111111111111111111111111111001010011100100101000111two's complement
One's complement00000000110101100011011010111000at 32 bits, every bit flipped
Bits reversed11100010100100111001010011111111at 32 bits
Rotated left by 111111110010100111001001010001111at 32 bits, wrapping
Shifted left by 1-1101011000110110101110010= -28,077,426, no wrap
Shifted right by 1-11010110001101101011101= -7,019,356, discarding the low bit
These bits as a double6.93604581 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+14,038,715
Nearest square below14,032,516
Nearest square above14,040,009

Powers & multiples

-14,038,713 to the power 2197,085,462,696,369
-14,038,713 to the power 3-2,766,826,247,266,530,533,097
-14,038,713 to the power 438,842,679,606,241,856,659,885,784,161
-14,038,713 to the power 5-545,301,231,142,982,434,235,275,136,616,224,793
First ten multiples-14,038,713, -28,077,426, -42,116,139, -56,154,852, -70,193,565, -84,232,278, -98,270,991, -112,309,704, -126,348,417, -140,387,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 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 13

As a percentage & fraction

As a percentage-1,403,871,300%
-14,038,713% as a decimal-140,387.13
-14,038,713% of 100-14,038,713
-14,038,713% of 1,000-140,387,130
As a fraction of 100-14,038,713/100

Keep nerding

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

Also reads as

14038713 (identifier)

  • 8 characters
  • Checksum fails

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