Recognised as Number
67,944
- Positive
- Even
- Composite
- 5 digits
67,944 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value67,944
Digit count5
Digit sum30
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 19 × 149
Distinct prime factors42, 3, 19, 149
Number of divisors32
Sum of divisors σ(n)180,000
Aliquot sum112,056sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,312integers below n that share no factor with it
Carmichael function λ(n)1,332the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,312
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 19, 24, 38, 57, 76, 114, 149, 152, 228, 298, 447, 456, 596, 894, 1,192, 1,788, 2,831, 3,576, 5,662, 8,493, 11,324, 16,986, 22,648, 33,972, 67,94432 in total
Arithmetic
Representations
Decimal67,944
Binary1000010010110100017 bits
Octal204550
Hexadecimal10968
Base 361GFC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, nine hundred and forty-four
Ordinalsixty-seven thousand, nine hundred and forty-fourth
Scientific notation6.7944 × 10^4
Engineering notation67.944 × 10^3
In other bases
Ternary10110012110base 3; the most digit-efficient integer base after e: 11 digits
Quinary4133234base 5; one hand: 7 digits
Septenary402042base 7: 6 digits
Nonary113173base 9; each digit is two ternary digits: 6 digits
Duodecimal333a0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal89h4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:52:24base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101101TT110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001111010111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000100101101000
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes301 09 68
Gray code11000110111011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000100101101000
64-bit0000000000000000000000000000000000000000000000010000100101101000
One's complement11111111111111101111011010010111at 32 bits, every bit flipped
Bits reversed00010110100100001000000000000000at 32 bits
Rotated left by 100000000000000100001001011010000at 32 bits, wrapping
Shifted left by 1100001001011010000= 135,888, no wrap
Shifted right by 11000010010110100= 33,972, discarding the low bit
These bits as a double3.35687962 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,944 to the power 24,616,387,136
67,944 to the power 3313,655,807,568,384
67,944 to the power 421,311,030,189,426,282,496
67,944 to the power 51,447,956,635,190,379,337,908,224
First ten multiples67,944, 135,888, 203,832, 271,776, 339,720, 407,664, 475,608, 543,552, 611,496, 679,440
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 8
Divisible by 12Yes
Divisible by 100No, remainder 44
Collatz (3n + 1) trajectory
Steps to reach 137the total stopping time
Highest value reached67,944
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,944 → 33,972 → 16,986 → 8,493 → 25,480 → 12,740 → 6,370 → 3,185 → 9,556 → 4,778 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,794,400%
67,944% as a decimal679.44
67,944% of 10067,944
67,944% of 1,000679,440
As a fraction of 10067,944/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 67,944
Nerdulate something else
Nothing in mind? Surprise me · today’s page