Recognised as Number

13,639

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value13,639

Digit count5

Digit sum22

Digit product486

Multiplicative persistence4times 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 factorisation23 × 593

Distinct prime factors223, 593

Number of divisors4

Sum of divisors σ(n)14,256

Aliquot sum617sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 23, 593, 13,6394 in total

Arithmetic

Previous number13,638

Next number13,640

Double27,278

Half6,819.5

Square186,022,321

Cube2,537,158,436,119

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

Cube root23.892458654≈

Negation-13,639

Reciprocal0.0000733192≈

Representations

Decimal13,639

Binary1101010100011114 bits

Octal32507

Hexadecimal3547

Base 36AIV

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

In wordsthirteen thousand, six hundred and thirty-nine

Ordinalthirteen thousand, six hundred and thirty-ninth

Scientific notation1.3639 × 10^4

Engineering notation13.639 × 10^3

In other bases

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

Quinary414024base 5; one hand: 6 digits

Septenary54523base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011010101000111

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 47

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

At each machine width

16-bit0011010101000111

32-bit00000000000000000011010101000111

64-bit0000000000000000000000000000000000000000000000000011010101000111

One's complement1100101010111000at 16 bits, every bit flipped

Bits reversed1110001010101100at 16 bits

Rotated left by 10110101010001110at 16 bits, wrapping

Shifted left by 1110101010001110= 27,278, no wrap

Shifted right by 11101010100011= 6,819, discarding the low bit

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

Nearest landmarks

Next prime13,649+10

Previous prime13,633−6

Distance to nearest prime6

Nearest square below13,456

Nearest square above13,689

Powers & multiples

13,639 to the power 2186,022,321

13,639 to the power 32,537,158,436,119

13,639 to the power 434,604,303,910,227,041

13,639 to the power 5471,968,101,031,586,612,199

First ten multiples13,639, 27,278, 40,917, 54,556, 68,195, 81,834, 95,473, 109,112, 122,751, 136,390

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 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 176the total stopping time

Highest value reached196,64814× the starting value

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

First steps13,639 → 40,918 → 20,459 → 61,378 → 30,689 → 92,068 → 46,034 → 23,017 → 69,052 → 34,526 → …

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

As a percentage & fraction

As a percentage1,363,900%

13,639% as a decimal136.39

13,639% of 10013,639

13,639% of 1,000136,390

As a fraction of 10013,639/100

Read another way

As seconds3 hours, 47 minutes and 19 seconds

As bytes13.319 KiB

As a 24-bit colour#003547

Keep nerding

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