Recognised as Number

32,509

Positive
Odd
Composite
5 digits

32,509 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,509

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation19 × 29 × 59

Distinct prime factors319, 29, 59

Number of divisors8

Sum of divisors σ(n)36,000

Aliquot sum3,491sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 19, 29, 59, 551, 1,121, 1,711, 32,5098 in total

Arithmetic

Previous number32,508

Next number32,510

Double65,018

Half16,254.5

Square1,056,835,081

Cube34,356,651,648,229

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

Cube root31.915466994≈

Negation-32,509

Reciprocal0.0000307607≈

Representations

Decimal32,509

Binary11111101111110115 bits

Octal77375

Hexadecimal7EFD

Base 36P31

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

In wordsthirty-two thousand, five hundred and nine

Ordinalthirty-two thousand, five hundred and ninth

Scientific notation3.2509 × 10^4

Engineering notation32.509 × 10^3

In other bases

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

Quinary2020014base 5; one hand: 7 digits

Septenary163531base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111011111101

Bit length15 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits2within that length

Bit parityodd13 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

Bytes27e fd

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

At each machine width

16-bit0111111011111101

32-bit00000000000000000111111011111101

64-bit0000000000000000000000000000000000000000000000000111111011111101

One's complement1000000100000010at 16 bits, every bit flipped

Bits reversed1011111101111110at 16 bits

Rotated left by 11111110111111010at 16 bits, wrapping

Shifted left by 11111110111111010= 65,018, no wrap

Shifted right by 111111101111110= 16,254, discarding the low bit

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

Nearest landmarks

Next prime32,531+22

Previous prime32,507−2

Distance to nearest prime2

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,509 to the power 21,056,835,081

32,509 to the power 334,356,651,648,229

32,509 to the power 41,116,900,388,432,276,561

32,509 to the power 536,309,314,727,544,878,721,549

First ten multiples32,509, 65,018, 97,527, 130,036, 162,545, 195,054, 227,563, 260,072, 292,581, 325,090

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached400,94812× the starting value

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

First steps32,509 → 97,528 → 48,764 → 24,382 → 12,191 → 36,574 → 18,287 → 54,862 → 27,431 → 82,294 → …

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

As a percentage & fraction

As a percentage3,250,900%

32,509% as a decimal325.09

32,509% of 10032,509

32,509% of 1,000325,090

As a fraction of 10032,509/100

Read another way

As seconds9 hours, 1 minute and 49 seconds

As bytes31.747 KiB

As a 24-bit colour#007EFD

Keep nerding

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