Recognised as Number
65,712
- Positive
- Even
- Composite
- 5 digits
65,712 is an even 5-digit integer and a composite number. It has 30 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value65,712
Digit count5
Digit sum21
Digit product420
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 3 × 37^2
Distinct prime factors32, 3, 37
Number of divisors30
Sum of divisors σ(n)174,468
Aliquot sum108,756sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,312integers below n that share no factor with it
Carmichael function λ(n)1,332the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,312
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 37, 48, 74, 111, 148, 222, 296, 444, 592, 888, 1,369, 1,776, 2,738, 4,107, 5,476, 8,214, 10,952, 16,428, 21,904, 32,856, 65,71230 in total
Arithmetic
Representations
Decimal65,712
Binary1000000001011000017 bits
Octal200260
Hexadecimal100B0
Base 361EPC
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand, seven hundred and twelve
Ordinalsixty-five thousand, seven hundred and twelfth
Scientific notation6.5712 × 10^4
Engineering notation65.712 × 10^3
In other bases
Ternary10100010210base 3; the most digit-efficient integer base after e: 11 digits
Quinary4100322base 5; one hand: 7 digits
Septenary362403base 7: 6 digits
Nonary110123base 9; each digit is two ternary digits: 6 digits
Duodecimal32040base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal845cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:15:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10100011T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000111110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000000010110000
Bit length17 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits13within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes301 00 b0
Gray code11000000011101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000000010110000
64-bit0000000000000000000000000000000000000000000000010000000010110000
One's complement11111111111111101111111101001111at 32 bits, every bit flipped
Bits reversed00001101000000001000000000000000at 32 bits
Rotated left by 100000000000000100000000101100000at 32 bits, wrapping
Shifted left by 1100000000101100000= 131,424, no wrap
Shifted right by 11000000001011000= 32,856, discarding the low bit
These bits as a double3.24660417 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
65,712 to the power 24,318,066,944
65,712 to the power 3283,748,815,024,128
65,712 to the power 418,645,702,132,865,499,136
65,712 to the power 51,225,246,378,554,857,679,224,832
First ten multiples65,712, 131,424, 197,136, 262,848, 328,560, 394,272, 459,984, 525,696, 591,408, 657,120
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 3
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12Yes
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 142the total stopping time
Highest value reached65,712
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,712 → 32,856 → 16,428 → 8,214 → 4,107 → 12,322 → 6,161 → 18,484 → 9,242 → 4,621 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,571,200%
65,712% as a decimal657.12
65,712% of 10065,712
65,712% of 1,000657,120
As a fraction of 10065,712/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 65,712
Nerdulate something else
Nothing in mind? Surprise me · today’s page