Recognised as Number
-13,556,477
- Negative
- Odd
- 8 digits
-13,556,477 is an odd 8-digit integer and the negative of 13,556,477. It has 12 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,556,477
Digit count8
Digit sum38
Digit product88,200
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 × 11^2 × 199 × 563
Distinct prime factors311, 199, 563
Number of divisors12
Sum of divisors σ(n)15,002,400
SquarefreeNohas a repeated prime factor
All divisors1, 11, 121, 199, 563, 2,189, 6,193, 24,079, 68,123, 112,037, 1,232,407, 13,556,47712 in total
Arithmetic
Previous number-13,556,478
Next number-13,556,476
Double-27,112,954
Half-6,778,238.5
Square183,778,068,651,529
Cube-2,491,383,160,778,873,903,333
Cube root-238.441738982≈
Negation13,556,477
Reciprocal-7.37654776 × 10^-8≈
Representations
Decimal-13,556,477
Binary11001110110110101111110124 bits
Octal63555375
HexadecimalCEDAFD
Base 3682K8T
In wordsminus thirteen million, five hundred and fifty-six thousand, four hundred and seventy-seven
Ordinalminus thirteen million, five hundred and fifty-six thousand, four hundred and seventy-seventh
Scientific notation-1.3556477 × 10^7
Engineering notation-13.556477 × 10^6
In other bases
Ternary221111201222202base 3; the most digit-efficient integer base after e: 15 digits
Quinary11432301402base 5; one hand: 11 digits
Septenary223141154base 7: 9 digits
Nonary27451882base 9; each digit is two ternary digits: 8 digits
Duodecimal4659225base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal44eb3hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:45:41:17base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0011111T10001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100010110010100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100010010010100000011
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
Bytes3ce da fd
Gray code101010011011011110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100010010010100000011two's complement
64-bit1111111111111111111111111111111111111111001100010010010100000011two's complement
One's complement00000000110011101101101011111100at 32 bits, every bit flipped
Bits reversed11000000101001001000110011111111at 32 bits
Rotated left by 111111110011000100100101000000111at 32 bits, wrapping
Shifted left by 1-1100111011011010111111010= -27,112,954, no wrap
Shifted right by 1-11001110110110101111111= -6,778,238, discarding the low bit
These bits as a double6.69778956 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,556,477 to the power 2183,778,068,651,529
-13,556,477 to the power 3-2,491,383,160,778,873,903,333
-13,556,477 to the power 433,774,378,517,286,106,156,434,037,841
-13,556,477 to the power 5-457,861,585,558,883,200,529,256,436,008,646,157
First ten multiples-13,556,477, -27,112,954, -40,669,431, -54,225,908, -67,782,385, -81,338,862, -94,895,339, -108,451,816, -122,008,293, -135,564,770
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
As a percentage & fraction
As a percentage-1,355,647,700%
-13,556,477% as a decimal-135,564.77
-13,556,477% of 100-13,556,477
-13,556,477% of 1,000-135,564,770
As a fraction of 100-13,556,477/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,556,477
Also reads as
13556477 (identifier)
- 8 characters
- Checksum valid
13556477 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for Luhn (cards, IMEI). 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 validmod 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