Recognised as Number

32,309

Positive
Odd
Prime
5 digits

32,309 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value32,309

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation32,309

Distinct prime factors132,309

Number of divisors2

Sum of divisors σ(n)32,310

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)32,308the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 32,3092 in total

Arithmetic

Previous number32,308

Next number32,310

Double64,618

Half16,154.5

Square1,043,871,481

Cube33,726,443,679,629

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

Cube root31.849882815≈

Negation-32,309

Reciprocal0.0000309511≈

Representations

Decimal32,309

Binary11111100011010115 bits

Octal77065

Hexadecimal7E35

Base 36OXH

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

In wordsthirty-two thousand, three hundred and nine

Ordinalthirty-two thousand, three hundred and ninth

Scientific notation3.2309 × 10^4

Engineering notation32.309 × 10^3

In other bases

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

Quinary2013214base 5; one hand: 7 digits

Septenary163124base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111000110101

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 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 35

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

At each machine width

16-bit0111111000110101

32-bit00000000000000000111111000110101

64-bit0000000000000000000000000000000000000000000000000111111000110101

One's complement1000000111001010at 16 bits, every bit flipped

Bits reversed1010110001111110at 16 bits

Rotated left by 11111110001101010at 16 bits, wrapping

Shifted left by 11111110001101010= 64,618, no wrap

Shifted right by 111111100011010= 16,154, discarding the low bit

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

Nearest landmarks

Next prime32,321+12

Previous prime32,303−6

Distance to nearest prime0, it is prime

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,309 to the power 21,043,871,481

32,309 to the power 333,726,443,679,629

32,309 to the power 41,089,667,668,845,133,361

32,309 to the power 535,206,072,712,717,413,760,549

First ten multiples32,309, 64,618, 96,927, 129,236, 161,545, 193,854, 226,163, 258,472, 290,781, 323,090

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 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached96,9283× the starting value

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

First steps32,309 → 96,928 → 48,464 → 24,232 → 12,116 → 6,058 → 3,029 → 9,088 → 4,544 → 2,272 → …

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

As a percentage & fraction

As a percentage3,230,900%

32,309% as a decimal323.09

32,309% of 10032,309

32,309% of 1,000323,090

As a fraction of 10032,309/100

Read another way

As seconds8 hours, 58 minutes and 29 seconds

As bytes31.552 KiB

As a 24-bit colour#007E35

Keep nerding

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