Recognised as Number
66,332
- Positive
- Even
- Composite
- 5 digits
66,332 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value66,332
Digit count5
Digit sum20
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 7 × 23 × 103
Distinct prime factors42, 7, 23, 103
Number of divisors24
Sum of divisors σ(n)139,776
Aliquot sum73,444sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)26,928integers below n that share no factor with it
Carmichael function λ(n)1,122the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,928
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 23, 28, 46, 92, 103, 161, 206, 322, 412, 644, 721, 1,442, 2,369, 2,884, 4,738, 9,476, 16,583, 33,166, 66,33224 in total
Arithmetic
Representations
Decimal66,332
Binary1000000110001110017 bits
Octal201434
Hexadecimal1031C
Base 361F6K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, three hundred and thirty-two
Ordinalsixty-six thousand, three hundred and thirty-second
Scientific notation6.6332 × 10^4
Engineering notation66.332 × 10^3
In other bases
Ternary10100222202base 3; the most digit-efficient integer base after e: 11 digits
Quinary4110312base 5; one hand: 7 digits
Septenary364250base 7: 6 digits
Nonary110882base 9; each digit is two ternary digits: 6 digits
Duodecimal32478base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal85gcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:25:32base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10101000T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000011101101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000001100011100
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 22 trailing zeros
Power of twoNo
Bytes301 03 1c
Gray code11000001010010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000001100011100
64-bit0000000000000000000000000000000000000000000000010000001100011100
One's complement11111111111111101111110011100011at 32 bits, every bit flipped
Bits reversed00111000110000001000000000000000at 32 bits
Rotated left by 100000000000000100000011000111000at 32 bits, wrapping
Shifted left by 1100000011000111000= 132,664, no wrap
Shifted right by 11000000110001110= 33,166, discarding the low bit
These bits as a double3.27723624 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
66,332 to the power 24,399,934,224
66,332 to the power 3291,856,436,946,368
66,332 to the power 419,359,421,175,526,482,176
66,332 to the power 51,284,149,125,415,022,615,698,432
First ten multiples66,332, 132,664, 198,996, 265,328, 331,660, 397,992, 464,324, 530,656, 596,988, 663,320
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 199the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,332 → 33,166 → 16,583 → 49,750 → 24,875 → 74,626 → 37,313 → 111,940 → 55,970 → 27,985 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,633,200%
66,332% as a decimal663.32
66,332% of 10066,332
66,332% of 1,000663,320
As a fraction of 10066,332/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 66,332
Nerdulate something else
Nothing in mind? Surprise me · today’s page