Recognised as Number

67,327

Positive
Odd
Composite
5 digits

67,327 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value67,327

Digit count5

Digit sum25

Digit product1,764

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 5,179

Distinct prime factors213, 5,179

Number of divisors4

Sum of divisors σ(n)72,520

Aliquot sum5,193sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,356the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 62,136

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 13, 5,179, 67,3274 in total

Arithmetic

Previous number67,326

Next number67,328

Double134,654

Half33,663.5

Square4,532,924,929

Cube305,188,236,694,783

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

Cube root40.68144973≈

Negation-67,327

Reciprocal0.0000148529≈

Representations

Decimal67,327

Binary1000001101111111117 bits

Octal203377

Hexadecimal106FF

Base 361FY7

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

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

Ordinalsixty-seven thousand, three hundred and twenty-seventh

Scientific notation6.7327 × 10^4

Engineering notation67.327 × 10^3

In other bases

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

Quinary4123302base 5; one hand: 7 digits

Septenary400201base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000011011111111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 06 ff

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

At each machine width

32-bit00000000000000010000011011111111

64-bit0000000000000000000000000000000000000000000000010000011011111111

One's complement11111111111111101111100100000000at 32 bits, every bit flipped

Bits reversed11111111011000001000000000000000at 32 bits

Rotated left by 100000000000000100000110111111110at 32 bits, wrapping

Shifted left by 1100000110111111110= 134,654, no wrap

Shifted right by 11000001101111111= 33,663, discarding the low bit

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

Nearest landmarks

Next prime67,339+12

Previous prime67,307−20

Distance to nearest prime12

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,327 to the power 24,532,924,929

67,327 to the power 3305,188,236,694,783

67,327 to the power 420,547,408,411,949,655,041

67,327 to the power 51,383,395,366,151,334,424,945,407

First ten multiples67,327, 134,654, 201,981, 269,308, 336,635, 403,962, 471,289, 538,616, 605,943, 673,270

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1174the total stopping time

Highest value reached8,405,188124× the starting value

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

First steps67,327 → 201,982 → 100,991 → 302,974 → 151,487 → 454,462 → 227,231 → 681,694 → 340,847 → 1,022,542 → …

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

As a percentage & fraction

As a percentage6,732,700%

67,327% as a decimal673.27

67,327% of 10067,327

67,327% of 1,000673,270

As a fraction of 10067,327/100

Read another way

As seconds18 hours, 42 minutes and 7 seconds

As bytes65.749 KiB

As a 24-bit colour#0106FF

Keep nerding

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