Recognised as Number
67,338
- Positive
- Even
- Composite
- 5 digits
67,338 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value67,338
Digit count5
Digit sum27
Digit product3,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^3 × 29 × 43
Distinct prime factors42, 3, 29, 43
Number of divisors32
Sum of divisors σ(n)158,400
Aliquot sum91,062sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,168integers below n that share no factor with it
Carmichael function λ(n)252the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,168
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 29, 43, 54, 58, 86, 87, 129, 174, 258, 261, 387, 522, 774, 783, 1,161, 1,247, 1,566, 2,322, 2,494, 3,741, 7,482, 11,223, 22,446, 33,669, 67,33832 in total
Arithmetic
Representations
Decimal67,338
Binary1000001110000101017 bits
Octal203412
Hexadecimal1070A
Base 361FYI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, three hundred and thirty-eight
Ordinalsixty-seven thousand, three hundred and thirty-eighth
Scientific notation6.7338 × 10^4
Engineering notation67.338 × 10^3
In other bases
Ternary10102101000base 3; the most digit-efficient integer base after e: 11 digits
Quinary4123323base 5; one hand: 7 digits
Septenary400215base 7: 6 digits
Nonary112330base 9; each digit is two ternary digits: 6 digits
Duodecimal32b76base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal886ibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:42:18base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011T101000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001101100011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000011100001010
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 11 trailing zero
Power of twoNo
Bytes301 07 0a
Gray code11000010010001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000011100001010
64-bit0000000000000000000000000000000000000000000000010000011100001010
One's complement11111111111111101111100011110101at 32 bits, every bit flipped
Bits reversed01010000111000001000000000000000at 32 bits
Rotated left by 100000000000000100000111000010100at 32 bits, wrapping
Shifted left by 1100000111000010100= 134,676, no wrap
Shifted right by 11000001110000101= 33,669, discarding the low bit
These bits as a double3.32693925 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,338 to the power 24,534,406,244
67,338 to the power 3305,337,847,658,472
67,338 to the power 420,560,839,985,626,187,536
67,338 to the power 51,384,525,842,952,096,216,299,168
First ten multiples67,338, 134,676, 202,014, 269,352, 336,690, 404,028, 471,366, 538,704, 606,042, 673,380
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,338 → 33,669 → 101,008 → 50,504 → 25,252 → 12,626 → 6,313 → 18,940 → 9,470 → 4,735 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,733,800%
67,338% as a decimal673.38
67,338% of 10067,338
67,338% of 1,000673,380
As a fraction of 10067,338/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,338
Nerdulate something else
Nothing in mind? Surprise me · today’s page