Recognised as Number
-13,094,109
- Negative
- Odd
- 8 digits
-13,094,109 is an odd 8-digit integer and the negative of 13,094,109. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,094,109
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^3 × 7 × 29 × 2,389
Distinct prime factors43, 7, 29, 2,389
Number of divisors32
Sum of divisors σ(n)22,944,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 29, 63, 87, 189, 203, 261, 609, 783, 1,827, 2,389, 5,481, 7,167, 16,723, 21,501, 50,169, 64,503, 69,281, 150,507, 207,843, 451,521, 484,967, 623,529, 1,454,901, 1,870,587, 4,364,703, 13,094,10932 in total
Arithmetic
Previous number-13,094,110
Next number-13,094,108
Double-26,188,218
Half-6,547,054.5
Square171,455,690,503,881
Cube-2,245,059,500,128,082,737,029
Cube root-235.699494231≈
Negation13,094,109
Reciprocal-7.63702211 × 10^-8≈
Representations
Decimal-13,094,109
Binary11000111110011001101110124 bits
Octal61746335
HexadecimalC7CCDD
Base 367SNH9
In wordsminus thirteen million, ninety-four thousand, one hundred and nine
Ordinalminus thirteen million, ninety-four thousand, one hundred and ninth
Scientific notation-1.3094109 × 10^7
Engineering notation-13.094109 × 10^6
In other bases
Ternary220122020202000base 3; the most digit-efficient integer base after e: 15 digits
Quinary11323002414base 5; one hand: 11 digits
Septenary216204150base 7: 9 digits
Nonary26566660base 9; each digit is two ternary digits: 8 digits
Duodecimal4475739base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal41gf59base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:0:37:15:9base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T101T1T1T1000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010000111011101100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001110000011001100100011
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes3c7 cc dd
Gray code101001000010101010110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001110000011001100100011two's complement
64-bit1111111111111111111111111111111111111111001110000011001100100011two's complement
One's complement00000000110001111100110011011100at 32 bits, every bit flipped
Bits reversed11000100110011000001110011111111at 32 bits
Rotated left by 111111110011100000110011001000111at 32 bits, wrapping
Shifted left by 1-1100011111001100110111010= -26,188,218, no wrap
Shifted right by 1-11000111110011001101111= -6,547,054, discarding the low bit
These bits as a double6.46934942 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,094,109 to the power 2171,455,690,503,881
-13,094,109 to the power 3-2,245,059,500,128,082,737,029
-13,094,109 to the power 429,397,053,806,162,629,319,676,062,161
-13,094,109 to the power 5-384,928,226,816,758,340,038,434,202,626,909,549
First ten multiples-13,094,109, -26,188,218, -39,282,327, -52,376,436, -65,470,545, -78,564,654, -91,658,763, -104,752,872, -117,846,981, -130,941,090
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 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-1,309,410,900%
-13,094,109% as a decimal-130,941.09
-13,094,109% of 100-13,094,109
-13,094,109% of 1,000-130,941,090
As a fraction of 100-13,094,109/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,094,109
Also reads as
13094109 (identifier)
- 8 characters
- Checksum fails
13094109 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