Recognised as Number

32,745

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,745

Digit count5

Digit sum21

Digit product840

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 37 × 59

Distinct prime factors43, 5, 37, 59

Number of divisors16

Sum of divisors σ(n)54,720

Aliquot sum21,975sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,044the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,704

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 37, 59, 111, 177, 185, 295, 555, 885, 2,183, 6,549, 10,915, 32,74516 in total

Arithmetic

Previous number32,744

Next number32,746

Double65,490

Half16,372.5

Square1,072,235,025

Cube35,110,335,893,625

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

Cube root31.992511268≈

Negation-32,745

Reciprocal0.000030539≈

Representations

Decimal32,745

Binary11111111110100115 bits

Octal77751

Hexadecimal7FE9

Base 36P9L

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

In wordsthirty-two thousand, seven hundred and forty-five

Ordinalthirty-two thousand, seven hundred and forty-fifth

Scientific notation3.2745 × 10^4

Engineering notation32.745 × 10^3

In other bases

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

Quinary2021440base 5; one hand: 7 digits

Septenary164316base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111111101001

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

Bytes27f e9

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

At each machine width

16-bit0111111111101001

32-bit00000000000000000111111111101001

64-bit0000000000000000000000000000000000000000000000000111111111101001

One's complement1000000000010110at 16 bits, every bit flipped

Bits reversed1001011111111110at 16 bits

Rotated left by 11111111111010010at 16 bits, wrapping

Shifted left by 11111111111010010= 65,490, no wrap

Shifted right by 111111111110100= 16,372, discarding the low bit

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

Nearest landmarks

Next prime32,749+4

Previous prime32,719−26

Distance to nearest prime4

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,745 to the power 21,072,235,025

32,745 to the power 335,110,335,893,625

32,745 to the power 41,149,687,948,836,750,625

32,745 to the power 537,646,531,884,659,399,215,625

First ten multiples32,745, 65,490, 98,235, 130,980, 163,725, 196,470, 229,215, 261,960, 294,705, 327,450

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 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached419,63212× the starting value

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

First steps32,745 → 98,236 → 49,118 → 24,559 → 73,678 → 36,839 → 110,518 → 55,259 → 165,778 → 82,889 → …

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

As a percentage & fraction

As a percentage3,274,500%

32,745% as a decimal327.45

32,745% of 10032,745

32,745% of 1,000327,450

As a fraction of 10032,745/100

Read another way

As seconds9 hours, 5 minutes and 45 seconds

As bytes31.978 KiB

As a 24-bit colour#007FE9

Keep nerding

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