Nerdulator> put something in

Recognised as Number

32,871

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value32,871
Digit count5
Digit sum21
Digit product336
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 10,957
Distinct prime factors23, 10,957
Number of divisors4
Sum of divisors σ(n)43,832
Aliquot sum10,961sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,912integers below n that share no factor with it
Carmichael function λ(n)10,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 10,957, 32,8714 in total

Arithmetic

Previous number32,870
Next number32,872
Double65,742
Square root181.30361276≈irrational, shown to 9 decimal places
Cube root32.033493577≈
Negation-32,871
Reciprocal0.000030422≈

Representations

Decimal32,871
Binary100000000110011116 bits
Octal100147
Hexadecimal8067
Base 36PD3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, eight hundred and seventy-one
Ordinalthirty-two thousand, eight hundred and seventy-first
Scientific notation3.2871 × 10^4
Engineering notation32.871 × 10^3

In other bases

Ternary1200002110base 3; the most digit-efficient integer base after e: 10 digits
Quinary2022441base 5; one hand: 7 digits
Septenary164556base 7: 6 digits
Nonary50073base 9; each digit is two ternary digits: 5 digits
Duodecimal17033base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal423bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:7:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0001T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000000001100111
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes280 67
Gray code1100000001010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000000001100111
32-bit00000000000000001000000001100111
64-bit0000000000000000000000000000000000000000000000001000000001100111
One's complement0111111110011000at 16 bits, every bit flipped
Bits reversed1110011000000001at 16 bits
Rotated left by 10000000011001111at 16 bits, wrapping
Shifted left by 110000000011001110= 65,742, no wrap
Shifted right by 1100000000110011= 16,435, discarding the low bit
These bits as a double1.62404318 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,887+16
Previous prime32,869−2
Distance to nearest prime2
Nearest square below32,761
Nearest square above33,124

Powers & multiples

32,871 to the power 21,080,502,641
32,871 to the power 335,517,202,312,311
32,871 to the power 41,167,485,957,207,974,881
32,871 to the power 538,376,430,899,383,342,313,351
First ten multiples32,871, 65,742, 98,613, 131,484, 164,355, 197,226, 230,097, 262,968, 295,839, 328,710
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1121the total stopping time
Highest value reached561,65217× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,871 → 98,614 → 49,307 → 147,922 → 73,961 → 221,884 → 110,942 → 55,471 → 166,414 → 83,207 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,287,100%
32,871% as a decimal328.71
32,871% of 10032,871
32,871% of 1,000328,710
As a fraction of 10032,871/100

Read another way

As bytes32.101 KiB
As a 24-bit colour#008067

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “32871” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.