Recognised as Number

32,180

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value32,180

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 1,609

Distinct prime factors32, 5, 1,609

Number of divisors12

Sum of divisors σ(n)67,620

Aliquot sum35,440sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)1,608the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,864

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 1,609, 3,218, 6,436, 8,045, 16,090, 32,18012 in total

Arithmetic

Previous number32,179

Next number32,181

Double64,360

Half16,090

Square1,035,552,400

Cube33,324,076,232,000

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

Cube root31.807437312≈

Negation-32,180

Reciprocal0.0000310752≈

Representations

Decimal32,180

Binary11111011011010015 bits

Octal76664

Hexadecimal7DB4

Base 36OTW

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

In wordsthirty-two thousand, one hundred and eighty

Ordinalthirty-two thousand, one hundred and eightieth

Scientific notation3.218 × 10^4

Engineering notation32.18 × 10^3

In other bases

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

Quinary2012210base 5; one hand: 7 digits

Septenary162551base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111110110110100

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 22 trailing zeros

Power of twoNo

Bytes27d b4

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

At each machine width

16-bit0111110110110100

32-bit00000000000000000111110110110100

64-bit0000000000000000000000000000000000000000000000000111110110110100

One's complement1000001001001011at 16 bits, every bit flipped

Bits reversed0010110110111110at 16 bits

Rotated left by 11111101101101000at 16 bits, wrapping

Shifted left by 11111101101101000= 64,360, no wrap

Shifted right by 111111011011010= 16,090, discarding the low bit

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

Nearest landmarks

Next prime32,183+3

Previous prime32,173−7

Distance to nearest prime3

Nearest square below32,041

Nearest square above32,400

Powers & multiples

32,180 to the power 21,035,552,400

32,180 to the power 333,324,076,232,000

32,180 to the power 41,072,368,773,145,760,000

32,180 to the power 534,508,827,119,830,556,800,000

First ten multiples32,180, 64,360, 96,540, 128,720, 160,900, 193,080, 225,260, 257,440, 289,620, 321,800

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 5

Divisible by 12No, remainder 8

Divisible by 100No, remainder 80

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time

Highest value reached32,180

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

First steps32,180 → 16,090 → 8,045 → 24,136 → 12,068 → 6,034 → 3,017 → 9,052 → 4,526 → 2,263 → …

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

As a percentage & fraction

As a percentage3,218,000%

32,180% as a decimal321.8

32,180% of 10032,180

32,180% of 1,000321,800

As a fraction of 10032,180/100

Read another way

As seconds8 hours, 56 minutes and 20 seconds

As bytes31.426 KiB

As a 24-bit colour#007DB4

Keep nerding

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