Recognised as Number

13,648

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value13,648

Digit count5

Digit sum22

Digit product576

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 853

Distinct prime factors22, 853

Number of divisors10

Sum of divisors σ(n)26,474

Aliquot sum12,826sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)852the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,816

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 853, 1,706, 3,412, 6,824, 13,64810 in total

Arithmetic

Previous number13,647

Next number13,649

Double27,296

Half6,824

Square186,267,904

Cube2,542,184,353,792

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

Cube root23.897712823≈

Negation-13,648

Reciprocal0.0000732708≈

Representations

Decimal13,648

Binary1101010101000014 bits

Octal32520

Hexadecimal3550

Base 36AJ4

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

In wordsthirteen thousand, six hundred and forty-eight

Ordinalthirteen thousand, six hundred and forty-eighth

Scientific notation1.3648 × 10^4

Engineering notation13.648 × 10^3

In other bases

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

Quinary414043base 5; one hand: 6 digits

Septenary54535base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101010000

Bit length14 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes235 50

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

At each machine width

16-bit0011010101010000

32-bit00000000000000000011010101010000

64-bit0000000000000000000000000000000000000000000000000011010101010000

One's complement1100101010101111at 16 bits, every bit flipped

Bits reversed0000101010101100at 16 bits

Rotated left by 10110101010100000at 16 bits, wrapping

Shifted left by 1110101010100000= 27,296, no wrap

Shifted right by 11101010101000= 6,824, discarding the low bit

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

Nearest landmarks

Next prime13,649+1

Previous prime13,633−15

Distance to nearest prime1

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,648 to the power 2186,267,904

13,648 to the power 32,542,184,353,792

13,648 to the power 434,695,732,060,553,216

13,648 to the power 5473,527,351,162,430,291,968

First ten multiples13,648, 27,296, 40,944, 54,592, 68,240, 81,888, 95,536, 109,184, 122,832, 136,480

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11No, remainder 8

Divisible by 12No, remainder 4

Divisible by 100No, remainder 48

Collatz (3n + 1) trajectory

Steps to reach 119the total stopping time

Highest value reached13,648

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

First steps13,648 → 6,824 → 3,412 → 1,706 → 853 → 2,560 → 1,280 → 640 → 320 → 160 → …

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

As a percentage & fraction

As a percentage1,364,800%

13,648% as a decimal136.48

13,648% of 10013,648

13,648% of 1,000136,480

As a fraction of 10013,648/100

Read another way

As seconds3 hours, 47 minutes and 28 seconds

As bytes13.328 KiB

As a 24-bit colour#003550

Keep nerding

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