Recognised as Number

32,681

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,681

Digit count5

Digit sum20

Digit product288

Multiplicative persistence4times 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 factorisation11 × 2,971

Distinct prime factors211, 2,971

Number of divisors4

Sum of divisors σ(n)35,664

Aliquot sum2,983sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 2,971, 32,6814 in total

Arithmetic

Previous number32,680

Next number32,682

Double65,362

Half16,340.5

Square1,068,047,761

Cube34,904,868,877,241

Square root180.778870447≈irrational, shown to 9 decimal places

Cube root31.971654587≈

Negation-32,681

Reciprocal0.0000305988≈

Representations

Decimal32,681

Binary11111111010100115 bits

Octal77651

Hexadecimal7FA9

Base 36P7T

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

In wordsthirty-two thousand, six hundred and eighty-one

Ordinalthirty-two thousand, six hundred and eighty-first

Scientific notation3.2681 × 10^4

Engineering notation32.681 × 10^3

In other bases

Ternary1122211102base 3; the most digit-efficient integer base after e: 10 digits

Quinary2021211base 5; one hand: 7 digits

Septenary164165base 7: 6 digits

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

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

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

Sexagesimal9:4:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111111110101001

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes27f a9

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

At each machine width

16-bit0111111110101001

32-bit00000000000000000111111110101001

64-bit0000000000000000000000000000000000000000000000000111111110101001

One's complement1000000001010110at 16 bits, every bit flipped

Bits reversed1001010111111110at 16 bits

Rotated left by 11111111101010010at 16 bits, wrapping

Shifted left by 11111111101010010= 65,362, no wrap

Shifted right by 111111111010100= 16,340, discarding the low bit

These bits as a double1.61465594 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,687+6

Previous prime32,653−28

Distance to nearest prime6

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,681 to the power 21,068,047,761

32,681 to the power 334,904,868,877,241

32,681 to the power 41,140,726,019,777,113,121

32,681 to the power 537,280,067,052,335,833,907,401

First ten multiples32,681, 65,362, 98,043, 130,724, 163,405, 196,086, 228,767, 261,448, 294,129, 326,810

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached2,417,84873× the starting value

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

First steps32,681 → 98,044 → 49,022 → 24,511 → 73,534 → 36,767 → 110,302 → 55,151 → 165,454 → 82,727 → …

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

As a percentage & fraction

As a percentage3,268,100%

32,681% as a decimal326.81

32,681% of 10032,681

32,681% of 1,000326,810

As a fraction of 10032,681/100

Read another way

As seconds9 hours, 4 minutes and 41 seconds

As bytes31.915 KiB

As a 24-bit colour#007FA9

Keep nerding

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