Recognised as Number

32,318

Positive
Even
Composite
5 digits

32,318 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value32,318

Digit count5

Digit sum17

Digit product144

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 11 × 13 × 113

Distinct prime factors42, 11, 13, 113

Number of divisors16

Sum of divisors σ(n)57,456

Aliquot sum25,138sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 11, 13, 22, 26, 113, 143, 226, 286, 1,243, 1,469, 2,486, 2,938, 16,159, 32,31816 in total

Arithmetic

Previous number32,317

Next number32,319

Double64,636

Half16,159

Square1,044,453,124

Cube33,754,636,061,432

Square root179.772077921≈irrational, shown to 9 decimal places

Cube root31.85283991≈

Negation-32,318

Reciprocal0.0000309425≈

Representations

Decimal32,318

Binary11111100011111015 bits

Octal77076

Hexadecimal7E3E

Base 36OXQ

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

In wordsthirty-two thousand, three hundred and eighteen

Ordinalthirty-two thousand, three hundred and eighteenth

Scientific notation3.2318 × 10^4

Engineering notation32.318 × 10^3

In other bases

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

Quinary2013233base 5; one hand: 7 digits

Septenary163136base 7: 6 digits

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

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

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

Sexagesimal8:58:38base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111111000111110

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes27e 3e

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

At each machine width

16-bit0111111000111110

32-bit00000000000000000111111000111110

64-bit0000000000000000000000000000000000000000000000000111111000111110

One's complement1000000111000001at 16 bits, every bit flipped

Bits reversed0111110001111110at 16 bits

Rotated left by 11111110001111100at 16 bits, wrapping

Shifted left by 11111110001111100= 64,636, no wrap

Shifted right by 111111100011111= 16,159, discarding the low bit

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

Nearest landmarks

Next prime32,321+3

Previous prime32,309−9

Distance to nearest prime3

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,318 to the power 21,044,453,124

32,318 to the power 333,754,636,061,432

32,318 to the power 41,090,882,328,233,359,376

32,318 to the power 535,255,135,083,845,708,313,568

First ten multiples32,318, 64,636, 96,954, 129,272, 161,590, 193,908, 226,226, 258,544, 290,862, 323,180

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 8

Divisible by 10No, remainder 8

Divisible by 11Yes

Divisible by 12No, remainder 2

Divisible by 100No, remainder 18

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached6,810,136210× the starting value

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

First steps32,318 → 16,159 → 48,478 → 24,239 → 72,718 → 36,359 → 109,078 → 54,539 → 163,618 → 81,809 → …

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

As a percentage & fraction

As a percentage3,231,800%

32,318% as a decimal323.18

32,318% of 10032,318

32,318% of 1,000323,180

As a fraction of 10032,318/100

Read another way

As seconds8 hours, 58 minutes and 38 seconds

As bytes31.561 KiB

As a 24-bit colour#007E3E

Keep nerding

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