Recognised as Number

32,255

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value32,255

Digit count5

Digit sum17

Digit product300

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 6,451

Distinct prime factors25, 6,451

Number of divisors4

Sum of divisors σ(n)38,712

Aliquot sum6,457sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,800

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 6,451, 32,2554 in total

Arithmetic

Previous number32,254

Next number32,256

Double64,510

Half16,127.5

Square1,040,385,025

Cube33,557,618,981,375

Square root179.596770572≈irrational, shown to 9 decimal places

Cube root31.832128703≈

Negation-32,255

Reciprocal0.0000310029≈

Representations

Decimal32,255

Binary11111011111111115 bits

Octal76777

Hexadecimal7DFF

Base 36OVZ

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

In wordsthirty-two thousand, two hundred and fifty-five

Ordinalthirty-two thousand, two hundred and fifty-fifth

Scientific notation3.2255 × 10^4

Engineering notation32.255 × 10^3

In other bases

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

Quinary2013010base 5; one hand: 7 digits

Septenary163016base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111110111111111

Bit length15 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits1within that length

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

Bytes27d ff

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

At each machine width

16-bit0111110111111111

32-bit00000000000000000111110111111111

64-bit0000000000000000000000000000000000000000000000000111110111111111

One's complement1000001000000000at 16 bits, every bit flipped

Bits reversed1111111110111110at 16 bits

Rotated left by 11111101111111110at 16 bits, wrapping

Shifted left by 11111101111111110= 64,510, no wrap

Shifted right by 111111011111111= 16,127, discarding the low bit

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

Nearest landmarks

Next prime32,257+2

Previous prime32,251−4

Distance to nearest prime2

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,255 to the power 21,040,385,025

32,255 to the power 333,557,618,981,375

32,255 to the power 41,082,401,000,244,250,625

32,255 to the power 534,912,844,262,878,303,909,375

First ten multiples32,255, 64,510, 96,765, 129,020, 161,275, 193,530, 225,785, 258,040, 290,295, 322,550

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 7

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 1191the total stopping time

Highest value reached2,480,05676× the starting value

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

First steps32,255 → 96,766 → 48,383 → 145,150 → 72,575 → 217,726 → 108,863 → 326,590 → 163,295 → 489,886 → …

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

As a percentage & fraction

As a percentage3,225,500%

32,255% as a decimal322.55

32,255% of 10032,255

32,255% of 1,000322,550

As a fraction of 10032,255/100

Read another way

As seconds8 hours, 57 minutes and 35 seconds

As bytes31.499 KiB

As a 24-bit colour#007DFF

Keep nerding

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