Recognised as Number

32,319

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,319

Digit count5

Digit sum18

Digit product162

Multiplicative persistence3times 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^5 × 7 × 19

Distinct prime factors33, 7, 19

Number of divisors24

Sum of divisors σ(n)58,240

Aliquot sum25,921sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)162the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,496

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 19, 21, 27, 57, 63, 81, 133, 171, 189, 243, 399, 513, 567, 1,197, 1,539, 1,701, 3,591, 4,617, 10,773, 32,31924 in total

Arithmetic

Previous number32,318

Next number32,320

Double64,638

Half16,159.5

Square1,044,517,761

Cube33,757,769,517,759

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

Cube root31.853168442≈

Negation-32,319

Reciprocal0.0000309416≈

Representations

Decimal32,319

Binary11111100011111115 bits

Octal77077

Hexadecimal7E3F

Base 36OXR

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

In wordsthirty-two thousand, three hundred and nineteen

Ordinalthirty-two thousand, three hundred and nineteenth

Scientific notation3.2319 × 10^4

Engineering notation32.319 × 10^3

In other bases

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

Quinary2013234base 5; one hand: 7 digits

Septenary163140base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111000111111

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

Bytes27e 3f

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

At each machine width

16-bit0111111000111111

32-bit00000000000000000111111000111111

64-bit0000000000000000000000000000000000000000000000000111111000111111

One's complement1000000111000000at 16 bits, every bit flipped

Bits reversed1111110001111110at 16 bits

Rotated left by 11111110001111110at 16 bits, wrapping

Shifted left by 11111110001111110= 64,638, no wrap

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

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

Nearest landmarks

Next prime32,321+2

Previous prime32,309−10

Distance to nearest prime2

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,319 to the power 21,044,517,761

32,319 to the power 333,757,769,517,759

32,319 to the power 41,091,017,353,044,453,121

32,319 to the power 535,260,589,833,043,680,417,599

First ten multiples32,319, 64,638, 96,957, 129,276, 161,595, 193,914, 226,233, 258,552, 290,871, 323,190

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 7Yes

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 3

Divisible by 100No, remainder 19

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,319 → 96,958 → 48,479 → 145,438 → 72,719 → 218,158 → 109,079 → 327,238 → 163,619 → 490,858 → …

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

As a percentage & fraction

As a percentage3,231,900%

32,319% as a decimal323.19

32,319% of 10032,319

32,319% of 1,000323,190

As a fraction of 10032,319/100

Read another way

As seconds8 hours, 58 minutes and 39 seconds

As bytes31.562 KiB

As a 24-bit colour#007E3F

Keep nerding

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