Recognised as Number

67,322

Positive
Even
Composite
5 digits

67,322 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value67,322

Digit count5

Digit sum20

Digit product504

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 41 × 821

Distinct prime factors32, 41, 821

Number of divisors8

Sum of divisors σ(n)103,572

Aliquot sum36,250sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,640the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,800

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 41, 82, 821, 1,642, 33,661, 67,3228 in total

Arithmetic

Previous number67,321

Next number67,323

Double134,644

Half33,661

Square4,532,251,684

Cube305,120,247,870,248

Square root259.464833841≈irrational, shown to 9 decimal places

Cube root40.680442644≈

Negation-67,322

Reciprocal0.000014854≈

Representations

Decimal67,322

Binary1000001101111101017 bits

Octal203372

Hexadecimal106FA

Base 361FY2

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

In wordssixty-seven thousand, three hundred and twenty-two

Ordinalsixty-seven thousand, three hundred and twenty-second

Scientific notation6.7322 × 10^4

Engineering notation67.322 × 10^3

In other bases

Ternary10102100102base 3; the most digit-efficient integer base after e: 11 digits

Quinary4123242base 5; one hand: 7 digits

Septenary400163base 7: 6 digits

Nonary112312base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal18:42:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010000011011111010

Bit length17 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 16worth 65,536

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes301 06 fa

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

At each machine width

32-bit00000000000000010000011011111010

64-bit0000000000000000000000000000000000000000000000010000011011111010

One's complement11111111111111101111100100000101at 32 bits, every bit flipped

Bits reversed01011111011000001000000000000000at 32 bits

Rotated left by 100000000000000100000110111110100at 32 bits, wrapping

Shifted left by 1100000110111110100= 134,644, no wrap

Shifted right by 11000001101111101= 33,661, discarding the low bit

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

Nearest landmarks

Next prime67,339+17

Previous prime67,307−15

Distance to nearest prime15

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,322 to the power 24,532,251,684

67,322 to the power 3305,120,247,870,248

67,322 to the power 420,541,305,327,120,835,856

67,322 to the power 51,382,881,757,232,428,911,497,632

First ten multiples67,322, 134,644, 201,966, 269,288, 336,610, 403,932, 471,254, 538,576, 605,898, 673,220

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 2

Divisible by 12No, remainder 2

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time

Highest value reached345,5445× the starting value

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

First steps67,322 → 33,661 → 100,984 → 50,492 → 25,246 → 12,623 → 37,870 → 18,935 → 56,806 → 28,403 → …

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

As a percentage & fraction

As a percentage6,732,200%

67,322% as a decimal673.22

67,322% of 10067,322

67,322% of 1,000673,220

As a fraction of 10067,322/100

Read another way

As seconds18 hours, 42 minutes and 2 seconds

As bytes65.744 KiB

As a 24-bit colour#0106FA

Keep nerding

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