Recognised as Number
-13,629,109
- Negative
- Odd
- 8 digits
-13,629,109 is an odd 8-digit integer and the negative of 13,629,109. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,629,109
Digit count8
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 53 × 131 × 151
Distinct prime factors413, 53, 131, 151
Number of divisors16
Sum of divisors σ(n)15,168,384
SquarefreeYesno repeated prime factor
All divisors1, 13, 53, 131, 151, 689, 1,703, 1,963, 6,943, 8,003, 19,781, 90,259, 104,039, 257,153, 1,048,393, 13,629,10916 in total
Arithmetic
Previous number-13,629,110
Next number-13,629,108
Double-27,258,218
Half-6,814,554.5
Square185,752,612,133,881
Cube-2,531,642,597,807,386,742,029
Cube root-238.866816549≈
Negation13,629,109
Reciprocal-7.33723679 × 10^-8≈
Representations
Decimal-13,629,109
Binary11001111111101101011010124 bits
Octal63773265
HexadecimalCFF6B5
Base 36844AD
In wordsminus thirteen million, six hundred and twenty-nine thousand, one hundred and nine
Ordinalminus thirteen million, six hundred and twenty-nine thousand, one hundred and ninth
Scientific notation-1.3629109 × 10^7
Engineering notation-13.629109 × 10^6
In other bases
Ternary221122102121211base 3; the most digit-efficient integer base after e: 15 digits
Quinary11442112414base 5; one hand: 11 digits
Septenary223563004base 7: 9 digits
Nonary27572554base 9; each digit is two ternary digits: 8 digits
Duodecimal4693271base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal453cf9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:3:5:51:49base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT001101TT01011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100000001100101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100000000100101001011
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
Bytes3cf f6 b5
Gray code101010000000110111101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100000000100101001011two's complement
64-bit1111111111111111111111111111111111111111001100000000100101001011two's complement
One's complement00000000110011111111011010110100at 32 bits, every bit flipped
Bits reversed11010010100100000000110011111111at 32 bits
Rotated left by 111111110011000000001001010010111at 32 bits, wrapping
Shifted left by 1-1100111111110110101101010= -27,258,218, no wrap
Shifted right by 1-11001111111101101011011= -6,814,554, discarding the low bit
These bits as a double6.73367454 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,629,109 to the power 2185,752,612,133,881
-13,629,109 to the power 3-2,531,642,597,807,386,742,029
-13,629,109 to the power 434,504,032,914,560,034,912,268,122,161
-13,629,109 to the power 5-470,259,225,532,126,402,863,107,674,157,584,549
First ten multiples-13,629,109, -27,258,218, -40,887,327, -54,516,436, -68,145,545, -81,774,654, -95,403,763, -109,032,872, -122,661,981, -136,291,090
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-1,362,910,900%
-13,629,109% as a decimal-136,291.09
-13,629,109% of 100-13,629,109
-13,629,109% of 1,000-136,291,090
As a fraction of 100-13,629,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,629,109
Also reads as
13629109 (identifier)
- 8 characters
- Checksum fails
13629109 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