Recognised as Number

13,641

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value13,641

Digit count5

Digit sum15

Digit product72

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 4,547

Distinct prime factors23, 4,547

Number of divisors4

Sum of divisors σ(n)18,192

Aliquot sum4,551sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,546the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,092

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 4,547, 13,6414 in total

Arithmetic

Previous number13,640

Next number13,642

Double27,282

Half6,820.5

Square186,076,881

Cube2,538,274,733,721

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

Cube root23.893626447≈

Negation-13,641

Reciprocal0.0000733084≈

Representations

Decimal13,641

Binary1101010100100114 bits

Octal32511

Hexadecimal3549

Base 36AIX

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

In wordsthirteen thousand, six hundred and forty-one

Ordinalthirteen thousand, six hundred and forty-first

Scientific notation1.3641 × 10^4

Engineering notation13.641 × 10^3

In other bases

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

Quinary414031base 5; one hand: 6 digits

Septenary54525base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101001001

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

Bit parityodd7 set bits, so odd; 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 49

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

At each machine width

16-bit0011010101001001

32-bit00000000000000000011010101001001

64-bit0000000000000000000000000000000000000000000000000011010101001001

One's complement1100101010110110at 16 bits, every bit flipped

Bits reversed1001001010101100at 16 bits

Rotated left by 10110101010010010at 16 bits, wrapping

Shifted left by 1110101010010010= 27,282, no wrap

Shifted right by 11101010100100= 6,820, discarding the low bit

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

Nearest landmarks

Next prime13,649+8

Previous prime13,633−8

Distance to nearest prime8

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,641 to the power 2186,076,881

13,641 to the power 32,538,274,733,721

13,641 to the power 434,624,605,642,688,161

13,641 to the power 5472,314,245,571,909,204,201

First ten multiples13,641, 27,282, 40,923, 54,564, 68,205, 81,846, 95,487, 109,128, 122,769, 136,410

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached69,0645× the starting value

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

First steps13,641 → 40,924 → 20,462 → 10,231 → 30,694 → 15,347 → 46,042 → 23,021 → 69,064 → 34,532 → …

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

As a percentage & fraction

As a percentage1,364,100%

13,641% as a decimal136.41

13,641% of 10013,641

13,641% of 1,000136,410

As a fraction of 10013,641/100

Read another way

As seconds3 hours, 47 minutes and 21 seconds

As bytes13.321 KiB

As a 24-bit colour#003549

Keep nerding

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