Recognised as Number

67,937

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value67,937

Digit count5

Digit sum32

Digit product7,938

Multiplicative persistence4times 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 factorisation41 × 1,657

Distinct prime factors241, 1,657

Number of divisors4

Sum of divisors σ(n)69,636

Aliquot sum1,699sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 66,240

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

SquarefreeYesno repeated prime factor

All divisors1, 41, 1,657, 67,9374 in total

Arithmetic

Previous number67,936

Next number67,938

Double135,874

Half33,968.5

Square4,615,435,969

Cube313,558,873,425,953

Square root260.647271231≈irrational, shown to 9 decimal places

Cube root40.803942013≈

Negation-67,937

Reciprocal0.0000147195≈

Representations

Decimal67,937

Binary1000010010110000117 bits

Octal204541

Hexadecimal10961

Base 361GF5

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

In wordssixty-seven thousand, nine hundred and thirty-seven

Ordinalsixty-seven thousand, nine hundred and thirty-seventh

Scientific notation6.7937 × 10^4

Engineering notation67.937 × 10^3

In other bases

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

Quinary4133222base 5; one hand: 7 digits

Septenary402032base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000100101100001

Bit length17 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits11within that length

Bit parityeven6 set bits, so even; 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 09 61

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

At each machine width

32-bit00000000000000010000100101100001

64-bit0000000000000000000000000000000000000000000000010000100101100001

One's complement11111111111111101111011010011110at 32 bits, every bit flipped

Bits reversed10000110100100001000000000000000at 32 bits

Rotated left by 100000000000000100001001011000010at 32 bits, wrapping

Shifted left by 1100001001011000010= 135,874, no wrap

Shifted right by 11000010010110000= 33,968, discarding the low bit

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

Nearest landmarks

Next prime67,939+2

Previous prime67,933−4

Distance to nearest prime2

Nearest square below67,600

Nearest square above68,121

Powers & multiples

67,937 to the power 24,615,435,969

67,937 to the power 3313,558,873,425,953

67,937 to the power 421,302,249,183,938,968,961

67,937 to the power 51,447,210,902,809,261,734,303,457

First ten multiples67,937, 135,874, 203,811, 271,748, 339,685, 407,622, 475,559, 543,496, 611,433, 679,370

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1205the total stopping time

Highest value reached2,789,15241× the starting value

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

First steps67,937 → 203,812 → 101,906 → 50,953 → 152,860 → 76,430 → 38,215 → 114,646 → 57,323 → 171,970 → …

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

As a percentage & fraction

As a percentage6,793,700%

67,937% as a decimal679.37

67,937% of 10067,937

67,937% of 1,000679,370

As a fraction of 10067,937/100

Read another way

As seconds18 hours, 52 minutes and 17 seconds

As bytes66.345 KiB

As a 24-bit colour#010961

Keep nerding

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