Recognised as Number
-13,277,403
- Negative
- Odd
- 8 digits
-13,277,403 is an odd 8-digit integer and the negative of 13,277,403. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,277,403
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 × 331 × 4,457
Distinct prime factors33, 331, 4,457
Number of divisors12
Sum of divisors σ(n)19,240,728
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 331, 993, 2,979, 4,457, 13,371, 40,113, 1,475,267, 4,425,801, 13,277,40312 in total
Arithmetic
Previous number-13,277,404
Next number-13,277,402
Double-26,554,806
Half-6,638,701.5
Square176,289,430,424,409
Cube-2,340,665,812,385,339,329,827
Cube root-236.794191891≈
Negation13,277,403
Reciprocal-7.53159334 × 10^-8≈
Representations
Decimal-13,277,403
Binary11001010100110001101101124 bits
Octal62514333
HexadecimalCA98DB
Base 367WKWR
In wordsminus thirteen million, two hundred and seventy-seven thousand, four hundred and three
Ordinalminus thirteen million, two hundred and seventy-seven thousand, four hundred and third
Scientific notation-1.3277403 × 10^7
Engineering notation-13.277403 × 10^6
In other bases
Ternary220222120011200base 3; the most digit-efficient integer base after e: 15 digits
Quinary11344334103base 5; one hand: 11 digits
Septenary220566426base 7: 9 digits
Nonary26876150base 9; each digit is two ternary digits: 8 digits
Duodecimal4543823base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal42jda3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:28:10:3base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T000110T11100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010101011101101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001101010110011100100101
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes3ca 98 db
Gray code101011111101010010110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001101010110011100100101two's complement
64-bit1111111111111111111111111111111111111111001101010110011100100101two's complement
One's complement00000000110010101001100011011010at 32 bits, every bit flipped
Bits reversed10100100111001101010110011111111at 32 bits
Rotated left by 111111110011010101100111001001011at 32 bits, wrapping
Shifted left by 1-1100101010011000110110110= -26,554,806, no wrap
Shifted right by 1-11001010100110001101110= -6,638,701, discarding the low bit
These bits as a double6.55990869 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,277,403 to the power 2176,289,430,424,409
-13,277,403 to the power 3-2,340,665,812,385,339,329,827
-13,277,403 to the power 431,077,963,279,362,541,573,862,999,281
-13,277,403 to the power 5-412,634,642,879,298,047,580,433,308,242,547,243
First ten multiples-13,277,403, -26,554,806, -39,832,209, -53,109,612, -66,387,015, -79,664,418, -92,941,821, -106,219,224, -119,496,627, -132,774,030
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 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 3
As a percentage & fraction
As a percentage-1,327,740,300%
-13,277,403% as a decimal-132,774.03
-13,277,403% of 100-13,277,403
-13,277,403% of 1,000-132,774,030
As a fraction of 100-13,277,403/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,277,403
Also reads as
13277403 (identifier)
- 8 characters
- Checksum fails
13277403 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