Recognised as Number

32,679

Positive
Odd
Composite
5 digits

32,679 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,679

Digit count5

Digit sum27

Digit product2,268

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 3,631

Distinct prime factors23, 3,631

Number of divisors6

Sum of divisors σ(n)47,216

Aliquot sum14,537sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,630the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,780

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 3,631, 10,893, 32,6796 in total

Arithmetic

Previous number32,678

Next number32,680

Double65,358

Half16,339.5

Square1,067,917,041

Cube34,898,460,982,839

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

Cube root31.971002377≈

Negation-32,679

Reciprocal0.0000306007≈

Representations

Decimal32,679

Binary11111111010011115 bits

Octal77647

Hexadecimal7FA7

Base 36P7R

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

In wordsthirty-two thousand, six hundred and seventy-nine

Ordinalthirty-two thousand, six hundred and seventy-ninth

Scientific notation3.2679 × 10^4

Engineering notation32.679 × 10^3

In other bases

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

Quinary2021204base 5; one hand: 7 digits

Septenary164163base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111110100111

Bit length15 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits3within that length

Bit parityeven12 set bits, so even; 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 a7

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

At each machine width

16-bit0111111110100111

32-bit00000000000000000111111110100111

64-bit0000000000000000000000000000000000000000000000000111111110100111

One's complement1000000001011000at 16 bits, every bit flipped

Bits reversed1110010111111110at 16 bits

Rotated left by 11111111101001110at 16 bits, wrapping

Shifted left by 11111111101001110= 65,358, no wrap

Shifted right by 111111111010011= 16,339, discarding the low bit

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

Nearest landmarks

Next prime32,687+8

Previous prime32,653−26

Distance to nearest prime8

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,679 to the power 21,067,917,041

32,679 to the power 334,898,460,982,839

32,679 to the power 41,140,446,806,458,195,681

32,679 to the power 537,268,661,188,247,376,659,399

First ten multiples32,679, 65,358, 98,037, 130,716, 163,395, 196,074, 228,753, 261,432, 294,111, 326,790

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached248,1647× the starting value

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

First steps32,679 → 98,038 → 49,019 → 147,058 → 73,529 → 220,588 → 110,294 → 55,147 → 165,442 → 82,721 → …

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

As a percentage & fraction

As a percentage3,267,900%

32,679% as a decimal326.79

32,679% of 10032,679

32,679% of 1,000326,790

As a fraction of 10032,679/100

Read another way

As seconds9 hours, 4 minutes and 39 seconds

As bytes31.913 KiB

As a 24-bit colour#007FA7

Keep nerding

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