Recognised as Number

13,649

Positive
Odd
Prime
5 digits

13,649 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value13,649

Digit count5

Digit sum23

Digit product648

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13,649

Distinct prime factors113,649

Number of divisors2

Sum of divisors σ(n)13,650

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 13,6492 in total

Arithmetic

Previous number13,648

Next number13,650

Double27,298

Half6,824.5

Square186,295,201

Cube2,542,743,198,449

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

Cube root23.898296477≈

Negation-13,649

Reciprocal0.0000732654≈

Representations

Decimal13,649

Binary1101010101000114 bits

Octal32521

Hexadecimal3551

Base 36AJ5

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

In wordsthirteen thousand, six hundred and forty-nine

Ordinalthirteen thousand, six hundred and forty-ninth

Scientific notation1.3649 × 10^4

Engineering notation13.649 × 10^3

In other bases

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

Quinary414044base 5; one hand: 6 digits

Septenary54536base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101010001

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 51

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

At each machine width

16-bit0011010101010001

32-bit00000000000000000011010101010001

64-bit0000000000000000000000000000000000000000000000000011010101010001

One's complement1100101010101110at 16 bits, every bit flipped

Bits reversed1000101010101100at 16 bits

Rotated left by 10110101010100010at 16 bits, wrapping

Shifted left by 1110101010100010= 27,298, no wrap

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

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

Nearest landmarks

Next prime13,669+20

Previous prime13,633−16

Distance to nearest prime0, it is prime

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,649 to the power 2186,295,201

13,649 to the power 32,542,743,198,449

13,649 to the power 434,705,901,915,630,401

13,649 to the power 5473,700,855,246,439,343,249

First ten multiples13,649, 27,298, 40,947, 54,596, 68,245, 81,894, 95,543, 109,192, 122,841, 136,490

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1120the total stopping time

Highest value reached897,85665× the starting value

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

First steps13,649 → 40,948 → 20,474 → 10,237 → 30,712 → 15,356 → 7,678 → 3,839 → 11,518 → 5,759 → …

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

As a percentage & fraction

As a percentage1,364,900%

13,649% as a decimal136.49

13,649% of 10013,649

13,649% of 1,000136,490

As a fraction of 10013,649/100

Read another way

As seconds3 hours, 47 minutes and 29 seconds

As bytes13.329 KiB

As a 24-bit colour#003551

Keep nerding

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