Recognised as Number
67,241
- Positive
- Odd
- Composite
- 5 digits
67,241 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value67,241
Digit count5
Digit sum20
Digit product336
Multiplicative persistence4times 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 factorisation19 × 3,539
Distinct prime factors219, 3,539
Number of divisors4
Sum of divisors σ(n)70,800
Aliquot sum3,559sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)63,684integers below n that share no factor with it
Carmichael function λ(n)31,842the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 63,684
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 3,539, 67,2414 in total
Arithmetic
Representations
Decimal67,241
Binary1000001101010100117 bits
Octal203251
Hexadecimal106A9
Base 361FVT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, two hundred and forty-one
Ordinalsixty-seven thousand, two hundred and forty-first
Scientific notation6.7241 × 10^4
Engineering notation67.241 × 10^3
In other bases
Ternary10102020102base 3; the most digit-efficient integer base after e: 11 digits
Quinary4122431base 5; one hand: 7 digits
Septenary400016base 7: 6 digits
Nonary112212base 9; each digit is two ternary digits: 6 digits
Duodecimal32ab5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8821base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:40:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011T1T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001101111111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000011010101001
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 a9
Gray code11000010111111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000011010101001
64-bit0000000000000000000000000000000000000000000000010000011010101001
One's complement11111111111111101111100101010110at 32 bits, every bit flipped
Bits reversed10010101011000001000000000000000at 32 bits
Rotated left by 100000000000000100000110101010010at 32 bits, wrapping
Shifted left by 1100000110101010010= 134,482, no wrap
Shifted right by 11000001101010100= 33,620, discarding the low bit
These bits as a double3.32214681 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,241 to the power 24,521,352,081
67,241 to the power 3304,020,235,278,521
67,241 to the power 420,442,624,640,363,030,561
67,241 to the power 51,374,582,523,442,650,537,952,201
First ten multiples67,241, 134,482, 201,723, 268,964, 336,205, 403,446, 470,687, 537,928, 605,169, 672,410
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1192the total stopping time
Highest value reached2,585,03238× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,241 → 201,724 → 100,862 → 50,431 → 151,294 → 75,647 → 226,942 → 113,471 → 340,414 → 170,207 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,724,100%
67,241% as a decimal672.41
67,241% of 10067,241
67,241% of 1,000672,410
As a fraction of 10067,241/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,241
Nerdulate something else
Nothing in mind? Surprise me · today’s page