Recognised as Number

13,643

Positive
Odd
Composite
5 digits

13,643 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value13,643

Digit count5

Digit sum17

Digit product216

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 1,949

Distinct prime factors27, 1,949

Number of divisors4

Sum of divisors σ(n)15,600

Aliquot sum1,957sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)11,688integers below n that share no factor with it

Carmichael function λ(n)5,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,688

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 1,949, 13,6434 in total

Arithmetic

Previous number13,642

Next number13,644

Double27,286

Half6,821.5

Square186,131,449

Cube2,539,391,358,707

Square root116.803253379≈irrational, shown to 9 decimal places

Cube root23.894794125≈

Negation-13,643

Reciprocal0.0000732977≈

Representations

Decimal13,643

Binary1101010100101114 bits

Octal32513

Hexadecimal354B

Base 36AIZ

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirteen thousand, six hundred and forty-three

Ordinalthirteen thousand, six hundred and forty-third

Scientific notation1.3643 × 10^4

Engineering notation13.643 × 10^3

In other bases

Ternary200201022base 3; the most digit-efficient integer base after e: 9 digits

Quinary414033base 5; one hand: 6 digits

Septenary54530base 7: 5 digits

Nonary20638base 9; each digit is two ternary digits: 5 digits

Duodecimal7a8bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal1e23base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:47:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T01T0110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111010101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010101001011

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

Bit parityeven8 set bits, so even; not the same as the number itself being odd

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes235 4b

Gray code10111111101110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011010101001011

32-bit00000000000000000011010101001011

64-bit0000000000000000000000000000000000000000000000000011010101001011

One's complement1100101010110100at 16 bits, every bit flipped

Bits reversed1101001010101100at 16 bits

Rotated left by 10110101010010110at 16 bits, wrapping

Shifted left by 1110101010010110= 27,286, no wrap

Shifted right by 11101010100101= 6,821, discarding the low bit

These bits as a double6.74053761 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime13,649+6

Previous prime13,633−10

Distance to nearest prime6

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,643 to the power 2186,131,449

13,643 to the power 32,539,391,358,707

13,643 to the power 434,644,916,306,839,601

13,643 to the power 5472,660,593,174,212,676,443

First ten multiples13,643, 27,286, 40,929, 54,572, 68,215, 81,858, 95,501, 109,144, 122,787, 136,430

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached61,3964× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps13,643 → 40,930 → 20,465 → 61,396 → 30,698 → 15,349 → 46,048 → 23,024 → 11,512 → 5,756 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,364,300%

13,643% as a decimal136.43

13,643% of 10013,643

13,643% of 1,000136,430

As a fraction of 10013,643/100

Read another way

As seconds3 hours, 47 minutes and 23 seconds

As bytes13.323 KiB

As a 24-bit colour#00354B

Keep nerding

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