Nerdulator> put something in

Recognised as Number

32,539

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value32,539
Digit count5
Digit sum22
Digit product810
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 2,503
Distinct prime factors213, 2,503
Number of divisors4
Sum of divisors σ(n)35,056
Aliquot sum2,517sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,024integers below n that share no factor with it
Carmichael function λ(n)5,004the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,024
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 2,503, 32,5394 in total

Arithmetic

Previous number32,538
Next number32,540
Double65,078
Square root180.385697881≈irrational, shown to 9 decimal places
Cube root31.9252814≈
Negation-32,539
Reciprocal0.0000307324≈

Representations

Decimal32,539
Binary11111110001101115 bits
Octal77433
Hexadecimal7F1B
Base 36P3V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, five hundred and thirty-nine
Ordinalthirty-two thousand, five hundred and thirty-ninth
Scientific notation3.2539 × 10^4
Engineering notation32.539 × 10^3

In other bases

Ternary1122122011base 3; the most digit-efficient integer base after e: 10 digits
Quinary2020124base 5; one hand: 7 digits
Septenary163603base 7: 6 digits
Nonary48564base 9; each digit is two ternary digits: 5 digits
Duodecimal169b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal416jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:2:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00T0T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000001101101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111111100011011
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27f 1b
Gray code100000010010110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111111100011011
32-bit00000000000000000111111100011011
64-bit0000000000000000000000000000000000000000000000000111111100011011
One's complement1000000011100100at 16 bits, every bit flipped
Bits reversed1101100011111110at 16 bits
Rotated left by 11111111000110110at 16 bits, wrapping
Shifted left by 11111111000110110= 65,078, no wrap
Shifted right by 111111110001101= 16,269, discarding the low bit
These bits as a double1.60764021 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,561+22
Previous prime32,537−2
Distance to nearest prime2
Nearest square below32,400
Nearest square above32,761

Powers & multiples

32,539 to the power 21,058,786,521
32,539 to the power 334,451,854,606,819
32,539 to the power 41,121,028,897,051,283,441
32,539 to the power 536,477,159,281,151,711,886,699
First ten multiples32,539, 65,078, 97,617, 130,156, 162,695, 195,234, 227,773, 260,312, 292,851, 325,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time
Highest value reached3,166,50497× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,539 → 97,618 → 48,809 → 146,428 → 73,214 → 36,607 → 109,822 → 54,911 → 164,734 → 82,367 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,253,900%
32,539% as a decimal325.39
32,539% of 10032,539
32,539% of 1,000325,390
As a fraction of 10032,539/100

Read another way

As bytes31.776 KiB
As a 24-bit colour#007F1B

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “32539” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.