Nerdulator> put something in

Recognised as Number

-13,629,107

  • Negative
  • Odd
  • 8 digits

-13,629,107 is an odd 8-digit integer and the negative of 13,629,107. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value13,629,107
Digit count8
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 47 × 409 × 709
Distinct prime factors347, 409, 709
Number of divisors8
Sum of divisors σ(n)13,972,800
SquarefreeYesno repeated prime factor
All divisors1, 47, 409, 709, 19,223, 33,323, 289,981, 13,629,1078 in total

Arithmetic

Previous number-13,629,108
Next number-13,629,106
Cube-2,531,641,483,291,877,488,043
Cube root-238.866804865
Negation13,629,107
Reciprocal-7.33723787 × 10^-8

Representations

Decimal-13,629,107
Binary11001111111101101011001124 bits
Octal63773263
HexadecimalCFF6B3
Base 36844AB
In wordsminus thirteen million, six hundred and twenty-nine thousand, one hundred and seven
Ordinalminus thirteen million, six hundred and twenty-nine thousand, one hundred and seventh
Scientific notation-1.3629107 × 10^7
Engineering notation-13.629107 × 10^6

In other bases

Ternary221122102121202base 3; the most digit-efficient integer base after e: 15 digits
Quinary11442112412base 5; one hand: 11 digits
Septenary223563002base 7: 9 digits
Nonary27572552base 9; each digit is two ternary digits: 8 digits
Duodecimal469326bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal453cf7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:3:5:51:47base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT001101TT01011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100000001100101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001100000000100101001101
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 b3
Gray code101010000000110111101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001100000000100101001101two's complement
64-bit1111111111111111111111111111111111111111001100000000100101001101two's complement
One's complement00000000110011111111011010110010at 32 bits, every bit flipped
Bits reversed10110010100100000000110011111111at 32 bits
Rotated left by 111111110011000000001001010011011at 32 bits, wrapping
Shifted left by 1-1100111111110110101100110= -27,258,214, no wrap
Shifted right by 1-11001111111101101011010= -6,814,553, discarding the low bit
These bits as a double6.73367355 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,629,109
Nearest square below13,623,481
Nearest square above13,630,864

Powers & multiples

-13,629,107 to the power 2185,752,557,617,449
-13,629,107 to the power 3-2,531,641,483,291,877,488,043
-13,629,107 to the power 434,504,012,661,423,710,515,429,267,601
-13,629,107 to the power 5-470,258,880,491,898,522,951,810,639,065,662,307
First ten multiples-13,629,107, -27,258,214, -40,887,321, -54,516,428, -68,145,535, -81,774,642, -95,403,749, -109,032,856, -122,661,963, -136,291,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7

As a percentage & fraction

As a percentage-1,362,910,700%
-13,629,107% as a decimal-136,291.07
-13,629,107% of 100-13,629,107
-13,629,107% of 1,000-136,291,070
As a fraction of 100-13,629,107/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

13629107 (identifier)

  • 8 characters
  • Checksum valid

13629107 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for ISSN. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

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 validmod 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

Every value on this page was computed from “-13629107” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.