Recognised as Number

13,645

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value13,645

Digit count5

Digit sum19

Digit product360

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 2,729

Distinct prime factors25, 2,729

Number of divisors4

Sum of divisors σ(n)16,380

Aliquot sum2,735sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,912

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 2,729, 13,6454 in total

Arithmetic

Previous number13,644

Next number13,646

Double27,290

Half6,822.5

Square186,186,025

Cube2,540,508,311,125

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

Cube root23.89596169≈

Negation-13,645

Reciprocal0.0000732869≈

Representations

Decimal13,645

Binary1101010100110114 bits

Octal32515

Hexadecimal354D

Base 36AJ1

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

In wordsthirteen thousand, six hundred and forty-five

Ordinalthirteen thousand, six hundred and forty-fifth

Scientific notation1.3645 × 10^4

Engineering notation13.645 × 10^3

In other bases

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

Quinary414040base 5; one hand: 6 digits

Septenary54532base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101001101

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 4d

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

At each machine width

16-bit0011010101001101

32-bit00000000000000000011010101001101

64-bit0000000000000000000000000000000000000000000000000011010101001101

One's complement1100101010110010at 16 bits, every bit flipped

Bits reversed1011001010101100at 16 bits

Rotated left by 10110101010011010at 16 bits, wrapping

Shifted left by 1110101010011010= 27,290, no wrap

Shifted right by 11101010100110= 6,822, discarding the low bit

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

Nearest landmarks

Next prime13,649+4

Previous prime13,633−12

Distance to nearest prime4

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,645 to the power 2186,186,025

13,645 to the power 32,540,508,311,125

13,645 to the power 434,665,235,905,300,625

13,645 to the power 5473,007,143,927,827,028,125

First ten multiples13,645, 27,290, 40,935, 54,580, 68,225, 81,870, 95,515, 109,160, 122,805, 136,450

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached65,6084× the starting value

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

First steps13,645 → 40,936 → 20,468 → 10,234 → 5,117 → 15,352 → 7,676 → 3,838 → 1,919 → 5,758 → …

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

As a percentage & fraction

As a percentage1,364,500%

13,645% as a decimal136.45

13,645% of 10013,645

13,645% of 1,000136,450

As a fraction of 10013,645/100

Read another way

As seconds3 hours, 47 minutes and 25 seconds

As bytes13.325 KiB

As a 24-bit colour#00354D

Keep nerding

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