Recognised as Number

13,646

Positive
Even
Composite
5 digits

13,646 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value13,646

Digit count5

Digit sum20

Digit product432

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 6,823

Distinct prime factors22, 6,823

Number of divisors4

Sum of divisors σ(n)20,472

Aliquot sum6,826sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,822the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 6,823, 13,6464 in total

Arithmetic

Previous number13,645

Next number13,647

Double27,292

Half6,823

Square186,213,316

Cube2,541,066,910,136

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

Cube root23.89654543≈

Negation-13,646

Reciprocal0.0000732815≈

Representations

Decimal13,646

Binary1101010100111014 bits

Octal32516

Hexadecimal354E

Base 36AJ2

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

In wordsthirteen thousand, six hundred and forty-six

Ordinalthirteen thousand, six hundred and forty-sixth

Scientific notation1.3646 × 10^4

Engineering notation13.646 × 10^3

In other bases

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

Quinary414041base 5; one hand: 6 digits

Septenary54533base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101001110

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 even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes235 4e

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

At each machine width

16-bit0011010101001110

32-bit00000000000000000011010101001110

64-bit0000000000000000000000000000000000000000000000000011010101001110

One's complement1100101010110001at 16 bits, every bit flipped

Bits reversed0111001010101100at 16 bits

Rotated left by 10110101010011100at 16 bits, wrapping

Shifted left by 1110101010011100= 27,292, no wrap

Shifted right by 11101010100111= 6,823, discarding the low bit

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

Nearest landmarks

Next prime13,649+3

Previous prime13,633−13

Distance to nearest prime3

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,646 to the power 2186,213,316

13,646 to the power 32,541,066,910,136

13,646 to the power 434,675,399,055,715,856

13,646 to the power 5473,180,495,514,298,570,976

First ten multiples13,646, 27,292, 40,938, 54,584, 68,230, 81,876, 95,522, 109,168, 122,814, 136,460

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12No, remainder 2

Divisible by 100No, remainder 46

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached560,35641× the starting value

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

First steps13,646 → 6,823 → 20,470 → 10,235 → 30,706 → 15,353 → 46,060 → 23,030 → 11,515 → 34,546 → …

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

As a percentage & fraction

As a percentage1,364,600%

13,646% as a decimal136.46

13,646% of 10013,646

13,646% of 1,000136,460

As a fraction of 10013,646/100

Read another way

As seconds3 hours, 47 minutes and 26 seconds

As bytes13.326 KiB

As a 24-bit colour#00354E

Keep nerding

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