Recognised as Number
66,732
- Positive
- Even
- Composite
- 5 digits
66,732 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value66,732
Digit count5
Digit sum24
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 67 × 83
Distinct prime factors42, 3, 67, 83
Number of divisors24
Sum of divisors σ(n)159,936
Aliquot sum93,204sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,648integers below n that share no factor with it
Carmichael function λ(n)2,706the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,648
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 67, 83, 134, 166, 201, 249, 268, 332, 402, 498, 804, 996, 5,561, 11,122, 16,683, 22,244, 33,366, 66,73224 in total
Arithmetic
Representations
Decimal66,732
Binary1000001001010110017 bits
Octal202254
Hexadecimal104AC
Base 361FHO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, seven hundred and thirty-two
Ordinalsixty-six thousand, seven hundred and thirty-second
Scientific notation6.6732 × 10^4
Engineering notation66.732 × 10^3
In other bases
Ternary10101112120base 3; the most digit-efficient integer base after e: 11 digits
Quinary4113412base 5; one hand: 7 digits
Septenary365361base 7: 6 digits
Nonary111476base 9; each digit is two ternary digits: 6 digits
Duodecimal32750base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal86gcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:32:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011TTT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010111111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000010010101100
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 04 ac
Gray code11000011011111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000010010101100
64-bit0000000000000000000000000000000000000000000000010000010010101100
One's complement11111111111111101111101101010011at 32 bits, every bit flipped
Bits reversed00110101001000001000000000000000at 32 bits
Rotated left by 100000000000000100000100101011000at 32 bits, wrapping
Shifted left by 1100000100101011000= 133,464, no wrap
Shifted right by 11000001001010110= 33,366, discarding the low bit
These bits as a double3.29699887 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
66,732 to the power 24,453,159,824
66,732 to the power 3297,168,261,375,168
66,732 to the power 419,830,632,418,087,710,976
66,732 to the power 51,323,337,762,523,829,128,850,432
First ten multiples66,732, 133,464, 200,196, 266,928, 333,660, 400,392, 467,124, 533,856, 600,588, 667,320
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 2
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,732 → 33,366 → 16,683 → 50,050 → 25,025 → 75,076 → 37,538 → 18,769 → 56,308 → 28,154 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,673,200%
66,732% as a decimal667.32
66,732% of 10066,732
66,732% of 1,000667,320
As a fraction of 10066,732/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,732
Nerdulate something else
Nothing in mind? Surprise me · today’s page