Recognised as Number
-13,409,277
- Negative
- Odd
- 8 digits
-13,409,277 is an odd 8-digit integer and the negative of 13,409,277. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,409,277
Digit count8
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 17 × 37,561
Distinct prime factors43, 7, 17, 37,561
Number of divisors16
Sum of divisors σ(n)21,635,712
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 17, 21, 51, 119, 357, 37,561, 112,683, 262,927, 638,537, 788,781, 1,915,611, 4,469,759, 13,409,27716 in total
Arithmetic
Previous number-13,409,278
Next number-13,409,276
Double-26,818,554
Half-6,704,638.5
Square179,808,709,662,729
Cube-2,411,104,794,880,109,736,933
Cube root-237.575574103≈
Negation13,409,277
Reciprocal-7.45752362 × 10^-8≈
Representations
Decimal-13,409,277
Binary11001100100110111111110124 bits
Octal63115775
HexadecimalCC9BFD
Base 367ZENX
In wordsminus thirteen million, four hundred and nine thousand, two hundred and seventy-seven
Ordinalminus thirteen million, four hundred and nine thousand, two hundred and seventy-seventh
Scientific notation-1.3409277 × 10^7
Engineering notation-13.409277 × 10^6
In other bases
Ternary221020021001220base 3; the most digit-efficient integer base after e: 15 digits
Quinary11413044102base 5; one hand: 11 digits
Septenary221656050base 7: 9 digits
Nonary27207056base 9; each digit is two ternary digits: 8 digits
Duodecimal45a7bb9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal43g33hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:4:47:57base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01TT10T1T0T1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101001010010000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100110110010000000011
Bit length24 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits8within that length
Bit parityeven16 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
Bytes3cc 9b fd
Gray code101010101101011000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100110110010000000011two's complement
64-bit1111111111111111111111111111111111111111001100110110010000000011two's complement
One's complement00000000110011001001101111111100at 32 bits, every bit flipped
Bits reversed11000000001001101100110011111111at 32 bits
Rotated left by 111111110011001101100100000000111at 32 bits, wrapping
Shifted left by 1-1100110010011011111111010= -26,818,554, no wrap
Shifted right by 1-11001100100110111111111= -6,704,638, discarding the low bit
These bits as a double6.6250631 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,409,277 to the power 2179,808,709,662,729
-13,409,277 to the power 3-2,411,104,794,880,109,736,933
-13,409,277 to the power 432,331,172,070,575,573,252,931,727,441
-13,409,277 to the power 5-433,537,642,029,011,411,182,352,595,344,870,157
First ten multiples-13,409,277, -26,818,554, -40,227,831, -53,637,108, -67,046,385, -80,455,662, -93,864,939, -107,274,216, -120,683,493, -134,092,770
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 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 77
As a percentage & fraction
As a percentage-1,340,927,700%
-13,409,277% as a decimal-134,092.77
-13,409,277% of 100-13,409,277
-13,409,277% of 1,000-134,092,770
As a fraction of 100-13,409,277/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,409,277
Also reads as
13409277 (identifier)
- 8 characters
- Checksum fails
13409277 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