Recognised as Number

32,674

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value32,674

Digit count5

Digit sum22

Digit product1,008

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 17 × 31^2

Distinct prime factors32, 17, 31

Number of divisors12

Sum of divisors σ(n)53,622

Aliquot sum20,948sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,880

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 17, 31, 34, 62, 527, 961, 1,054, 1,922, 16,337, 32,67412 in total

Arithmetic

Previous number32,673

Next number32,675

Double65,348

Half16,337

Square1,067,590,276

Cube34,882,444,678,024

Square root180.75950874≈irrational, shown to 9 decimal places

Cube root31.969371736≈

Negation-32,674

Reciprocal0.0000306054≈

Representations

Decimal32,674

Binary11111111010001015 bits

Octal77642

Hexadecimal7FA2

Base 36P7M

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

In wordsthirty-two thousand, six hundred and seventy-four

Ordinalthirty-two thousand, six hundred and seventy-fourth

Scientific notation3.2674 × 10^4

Engineering notation32.674 × 10^3

In other bases

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

Quinary2021144base 5; one hand: 7 digits

Septenary164155base 7: 6 digits

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

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

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

Sexagesimal9:4:34base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111111110100010

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes27f a2

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

At each machine width

16-bit0111111110100010

32-bit00000000000000000111111110100010

64-bit0000000000000000000000000000000000000000000000000111111110100010

One's complement1000000001011101at 16 bits, every bit flipped

Bits reversed0100010111111110at 16 bits

Rotated left by 11111111101000100at 16 bits, wrapping

Shifted left by 11111111101000100= 65,348, no wrap

Shifted right by 111111111010001= 16,337, discarding the low bit

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

Nearest landmarks

Next prime32,687+13

Previous prime32,653−21

Distance to nearest prime13

Nearest square below32,400

Nearest square above32,761

Powers & multiples

32,674 to the power 21,067,590,276

32,674 to the power 334,882,444,678,024

32,674 to the power 41,139,748,997,409,756,176

32,674 to the power 537,240,158,741,366,373,294,624

First ten multiples32,674, 65,348, 98,022, 130,696, 163,370, 196,044, 228,718, 261,392, 294,066, 326,740

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 4

Divisible by 10No, remainder 4

Divisible by 11No, remainder 4

Divisible by 12No, remainder 10

Divisible by 100No, remainder 74

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached49,0121× the starting value

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

First steps32,674 → 16,337 → 49,012 → 24,506 → 12,253 → 36,760 → 18,380 → 9,190 → 4,595 → 13,786 → …

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

As a percentage & fraction

As a percentage3,267,400%

32,674% as a decimal326.74

32,674% of 10032,674

32,674% of 1,000326,740

As a fraction of 10032,674/100

Read another way

As seconds9 hours, 4 minutes and 34 seconds

As bytes31.908 KiB

As a 24-bit colour#007FA2

Keep nerding

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