Recognised as Number

32,747

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,747

Digit count5

Digit sum23

Digit product1,176

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 13 × 229

Distinct prime factors311, 13, 229

Number of divisors8

Sum of divisors σ(n)38,640

Aliquot sum5,893sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,360

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 13, 143, 229, 2,519, 2,977, 32,7478 in total

Arithmetic

Previous number32,746

Next number32,748

Double65,494

Half16,373.5

Square1,072,366,009

Cube35,116,769,696,723

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

Cube root31.993162602≈

Negation-32,747

Reciprocal0.0000305371≈

Representations

Decimal32,747

Binary11111111110101115 bits

Octal77753

Hexadecimal7FEB

Base 36P9N

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

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

Ordinalthirty-two thousand, seven hundred and forty-seventh

Scientific notation3.2747 × 10^4

Engineering notation32.747 × 10^3

In other bases

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

Quinary2021442base 5; one hand: 7 digits

Septenary164321base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111111101011

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

Bytes27f eb

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

At each machine width

16-bit0111111111101011

32-bit00000000000000000111111111101011

64-bit0000000000000000000000000000000000000000000000000111111111101011

One's complement1000000000010100at 16 bits, every bit flipped

Bits reversed1101011111111110at 16 bits

Rotated left by 11111111111010110at 16 bits, wrapping

Shifted left by 11111111111010110= 65,494, no wrap

Shifted right by 111111111110101= 16,373, discarding the low bit

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

Nearest landmarks

Next prime32,749+2

Previous prime32,719−28

Distance to nearest prime2

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,747 to the power 21,072,366,009

32,747 to the power 335,116,769,696,723

32,747 to the power 41,149,968,857,258,588,081

32,747 to the power 537,658,030,168,646,983,888,507

First ten multiples32,747, 65,494, 98,241, 130,988, 163,735, 196,482, 229,229, 261,976, 294,723, 327,470

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 11

Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 172the total stopping time

Highest value reached472,12014× the starting value

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

First steps32,747 → 98,242 → 49,121 → 147,364 → 73,682 → 36,841 → 110,524 → 55,262 → 27,631 → 82,894 → …

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

As a percentage & fraction

As a percentage3,274,700%

32,747% as a decimal327.47

32,747% of 10032,747

32,747% of 1,000327,470

As a fraction of 10032,747/100

Read another way

As seconds9 hours, 5 minutes and 47 seconds

As bytes31.979 KiB

As a 24-bit colour#007FEB

Keep nerding

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