Recognised as Number
67,466
- Positive
- Even
- Composite
- 5 digits
67,466 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value67,466
Digit count5
Digit sum29
Digit product6,048
Multiplicative persistence2times 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 factorisation2 × 7 × 61 × 79
Distinct prime factors42, 7, 61, 79
Number of divisors16
Sum of divisors σ(n)119,040
Aliquot sum51,574sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)28,080integers below n that share no factor with it
Carmichael function λ(n)780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,080
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 61, 79, 122, 158, 427, 553, 854, 1,106, 4,819, 9,638, 33,733, 67,46616 in total
Arithmetic
Representations
Decimal67,466
Binary1000001111000101017 bits
Octal203612
Hexadecimal1078A
Base 361G22
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, four hundred and sixty-six
Ordinalsixty-seven thousand, four hundred and sixty-sixth
Scientific notation6.7466 × 10^4
Engineering notation67.466 × 10^3
In other bases
Ternary10102112202base 3; the most digit-efficient integer base after e: 11 digits
Quinary4124331base 5; one hand: 7 digits
Septenary400460base 7: 6 digits
Nonary112482base 9; each digit is two ternary digits: 6 digits
Duodecimal33062base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal88d6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:44:26base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10110TT0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100010011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000011110001010
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 07 8a
Gray code11000010001001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000011110001010
64-bit0000000000000000000000000000000000000000000000010000011110001010
One's complement11111111111111101111100001110101at 32 bits, every bit flipped
Bits reversed01010001111000001000000000000000at 32 bits
Rotated left by 100000000000000100000111100010100at 32 bits, wrapping
Shifted left by 1100000111100010100= 134,932, no wrap
Shifted right by 11000001111000101= 33,733, discarding the low bit
These bits as a double3.33326329 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,466 to the power 24,551,661,156
67,466 to the power 3307,082,371,550,696
67,466 to the power 420,717,619,279,039,256,336
67,466 to the power 51,397,734,902,279,662,467,964,576
First ten multiples67,466, 134,932, 202,398, 269,864, 337,330, 404,796, 472,262, 539,728, 607,194, 674,660
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,466 → 33,733 → 101,200 → 50,600 → 25,300 → 12,650 → 6,325 → 18,976 → 9,488 → 4,744 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,746,600%
67,466% as a decimal674.66
67,466% of 10067,466
67,466% of 1,000674,660
As a fraction of 10067,466/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,466
Nerdulate something else
Nothing in mind? Surprise me · today’s page