Nerdulator> put something in

Recognised as Number

32,872

  • Positive
  • Even
  • Composite
  • 5 digits

32,872 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value32,872
Digit count5
Digit sum22
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 7 × 587
Distinct prime factors32, 7, 587
Number of divisors16
Sum of divisors σ(n)70,560
Aliquot sum37,688sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)14,064integers below n that share no factor with it
Carmichael function λ(n)1,758the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,064
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 28, 56, 587, 1,174, 2,348, 4,109, 4,696, 8,218, 16,436, 32,87216 in total

Arithmetic

Previous number32,871
Next number32,873
Double65,744
Half16,436
Square root181.306370544≈irrational, shown to 9 decimal places
Cube root32.033818414≈
Negation-32,872
Reciprocal0.000030421≈

Representations

Decimal32,872
Binary100000000110100016 bits
Octal100150
Hexadecimal8068
Base 36PD4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, eight hundred and seventy-two
Ordinalthirty-two thousand, eight hundred and seventy-second
Scientific notation3.2872 × 10^4
Engineering notation32.872 × 10^3

In other bases

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

Bit-level

1000000001101000
Bit length16 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits12within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes280 68
Gray code1100000001011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000000001101000
32-bit00000000000000001000000001101000
64-bit0000000000000000000000000000000000000000000000001000000001101000
One's complement0111111110010111at 16 bits, every bit flipped
Bits reversed0001011000000001at 16 bits
Rotated left by 10000000011010001at 16 bits, wrapping
Shifted left by 110000000011010000= 65,744, no wrap
Shifted right by 1100000000110100= 16,436, discarding the low bit
These bits as a double1.62409259 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,887+15
Previous prime32,869−3
Distance to nearest prime3
Nearest square below32,761
Nearest square above33,124

Powers & multiples

32,872 to the power 21,080,568,384
32,872 to the power 335,520,443,918,848
32,872 to the power 41,167,628,032,500,371,456
32,872 to the power 538,382,268,684,352,210,501,632
First ten multiples32,872, 65,744, 98,616, 131,488, 164,360, 197,232, 230,104, 262,976, 295,848, 328,720
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 141the total stopping time
Highest value reached32,872
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,872 → 16,436 → 8,218 → 4,109 → 12,328 → 6,164 → 3,082 → 1,541 → 4,624 → 2,312 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,287,200%
32,872% as a decimal328.72
32,872% of 10032,872
32,872% of 1,000328,720
As a fraction of 10032,872/100

Read another way

As bytes32.102 KiB
As a 24-bit colour#008068

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 “32872” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.