Nerdulator> put something in

Recognised as Number

32,874

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value32,874
Digit count5
Digit sum24
Digit product1,344
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5,479
Distinct prime factors32, 3, 5,479
Number of divisors8
Sum of divisors σ(n)65,760
Aliquot sum32,886sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)10,956integers below n that share no factor with it
Carmichael function λ(n)5,478the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,956
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 5,479, 10,958, 16,437, 32,8748 in total

Arithmetic

Previous number32,873
Next number32,875
Double65,748
Half16,437
Square root181.311885987≈irrational, shown to 9 decimal places
Cube root32.034468069≈
Negation-32,874
Reciprocal0.0000304192≈

Representations

Decimal32,874
Binary100000000110101016 bits
Octal100152
Hexadecimal806A
Base 36PD6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-two thousand, eight hundred and seventy-four
Ordinalthirty-two thousand, eight hundred and seventy-fourth
Scientific notation3.2874 × 10^4
Engineering notation32.874 × 10^3

In other bases

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

Bit-level

1000000001101010
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes280 6a
Gray code1100000001011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000000001101010
32-bit00000000000000001000000001101010
64-bit0000000000000000000000000000000000000000000000001000000001101010
One's complement0111111110010101at 16 bits, every bit flipped
Bits reversed0101011000000001at 16 bits
Rotated left by 10000000011010101at 16 bits, wrapping
Shifted left by 110000000011010100= 65,748, no wrap
Shifted right by 1100000000110101= 16,437, discarding the low bit
These bits as a double1.6241914 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime32,887+13
Previous prime32,869−5
Distance to nearest prime5
Nearest square below32,761
Nearest square above33,124

Powers & multiples

32,874 to the power 21,080,699,876
32,874 to the power 335,526,927,723,624
32,874 to the power 41,167,912,221,986,415,376
32,874 to the power 538,393,946,385,581,419,070,624
First ten multiples32,874, 65,748, 98,622, 131,496, 164,370, 197,244, 230,118, 262,992, 295,866, 328,740
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 141the total stopping time
Highest value reached49,3121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps32,874 → 16,437 → 49,312 → 24,656 → 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,400%
32,874% as a decimal328.74
32,874% of 10032,874
32,874% of 1,000328,740
As a fraction of 10032,874/100

Read another way

As bytes32.104 KiB
As a 24-bit colour#00806A

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