Recognised as Number

32,257

Positive
Odd
Prime
5 digits

32,257 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value32,257

Digit count5

Digit sum19

Digit product420

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation32,257

Distinct prime factors132,257

Number of divisors2

Sum of divisors σ(n)32,258

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)32,256the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 32,2572 in total

Arithmetic

Previous number32,256

Next number32,258

Double64,514

Half16,128.5

Square1,040,514,049

Cube33,563,861,678,593

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

Cube root31.832786616≈

Negation-32,257

Reciprocal0.000031001≈

Representations

Decimal32,257

Binary11111100000000115 bits

Octal77001

Hexadecimal7E01

Base 36OW1

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

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

Ordinalthirty-two thousand, two hundred and fifty-seventh

Scientific notation3.2257 × 10^4

Engineering notation32.257 × 10^3

In other bases

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

Quinary2013012base 5; one hand: 7 digits

Septenary163021base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111111000000001

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

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

Bytes27e 01

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

At each machine width

16-bit0111111000000001

32-bit00000000000000000111111000000001

64-bit0000000000000000000000000000000000000000000000000111111000000001

One's complement1000000111111110at 16 bits, every bit flipped

Bits reversed1000000001111110at 16 bits

Rotated left by 11111110000000010at 16 bits, wrapping

Shifted left by 11111110000000010= 64,514, no wrap

Shifted right by 111111100000000= 16,128, discarding the low bit

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

Nearest landmarks

Next prime32,261+4

Previous prime32,251−6

Distance to nearest prime0, it is prime

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,257 to the power 21,040,514,049

32,257 to the power 333,563,861,678,593

32,257 to the power 41,082,669,486,166,374,401

32,257 to the power 534,923,669,615,268,739,053,057

First ten multiples32,257, 64,514, 96,771, 129,028, 161,285, 193,542, 225,799, 258,056, 290,313, 322,570

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time

Highest value reached155,0324× the starting value

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

First steps32,257 → 96,772 → 48,386 → 24,193 → 72,580 → 36,290 → 18,145 → 54,436 → 27,218 → 13,609 → …

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

As a percentage & fraction

As a percentage3,225,700%

32,257% as a decimal322.57

32,257% of 10032,257

32,257% of 1,000322,570

As a fraction of 10032,257/100

Read another way

As seconds8 hours, 57 minutes and 37 seconds

As bytes31.501 KiB

As a 24-bit colour#007E01

Keep nerding

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