Recognised as Number

32,675

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,675

Digit count5

Digit sum23

Digit product1,260

Multiplicative persistence2times 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 factorisation5^2 × 1,307

Distinct prime factors25, 1,307

Number of divisors6

Sum of divisors σ(n)40,548

Aliquot sum7,873sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)13,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,120

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 1,307, 6,535, 32,6756 in total

Arithmetic

Previous number32,674

Next number32,676

Double65,350

Half16,337.5

Square1,067,655,625

Cube34,885,647,546,875

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

Cube root31.969697877≈

Negation-32,675

Reciprocal0.0000306044≈

Representations

Decimal32,675

Binary11111111010001115 bits

Octal77643

Hexadecimal7FA3

Base 36P7N

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

In wordsthirty-two thousand, six hundred and seventy-five

Ordinalthirty-two thousand, six hundred and seventy-fifth

Scientific notation3.2675 × 10^4

Engineering notation32.675 × 10^3

In other bases

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

Quinary2021200base 5; one hand: 7 digits

Septenary164156base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111110100011

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 a3

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

At each machine width

16-bit0111111110100011

32-bit00000000000000000111111110100011

64-bit0000000000000000000000000000000000000000000000000111111110100011

One's complement1000000001011100at 16 bits, every bit flipped

Bits reversed1100010111111110at 16 bits

Rotated left by 11111111101000110at 16 bits, wrapping

Shifted left by 11111111101000110= 65,350, no wrap

Shifted right by 111111111010001= 16,337, discarding the low bit

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

Nearest landmarks

Next prime32,687+12

Previous prime32,653−22

Distance to nearest prime12

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,675 to the power 21,067,655,625

32,675 to the power 334,885,647,546,875

32,675 to the power 41,139,888,533,594,140,625

32,675 to the power 537,245,857,835,188,544,921,875

First ten multiples32,675, 65,350, 98,025, 130,700, 163,375, 196,050, 228,725, 261,400, 294,075, 326,750

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached147,0404× the starting value

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

First steps32,675 → 98,026 → 49,013 → 147,040 → 73,520 → 36,760 → 18,380 → 9,190 → 4,595 → 13,786 → …

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

As a percentage & fraction

As a percentage3,267,500%

32,675% as a decimal326.75

32,675% of 10032,675

32,675% of 1,000326,750

As a fraction of 10032,675/100

Read another way

As seconds9 hours, 4 minutes and 35 seconds

As bytes31.909 KiB

As a 24-bit colour#007FA3

Keep nerding

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