Nerdulator> put something in

Recognised as Number

65,742

  • Positive
  • Even
  • Composite
  • 5 digits

65,742 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value65,742
Digit count5
Digit sum24
Digit product1,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 10,957
Distinct prime factors32, 3, 10,957
Number of divisors8
Sum of divisors σ(n)131,496
Aliquot sum65,754sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,912integers below n that share no factor with it
Carmichael function λ(n)10,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,912
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 10,957, 21,914, 32,871, 65,7428 in total

Arithmetic

Previous number65,741
Next number65,743
Double131,484
Half32,871
Square root256.402028073≈irrational, shown to 9 decimal places
Cube root40.359672859≈
Negation-65,742
Reciprocal0.000015211≈

Representations

Decimal65,742
Binary1000000001100111017 bits
Octal200316
Hexadecimal100CE
Base 361EQ6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand, seven hundred and forty-two
Ordinalsixty-five thousand, seven hundred and forty-second
Scientific notation6.5742 × 10^4
Engineering notation65.742 × 10^3

In other bases

Ternary10100011220base 3; the most digit-efficient integer base after e: 11 digits
Quinary4100432base 5; one hand: 7 digits
Septenary362445base 7: 6 digits
Nonary110156base 9; each digit is two ternary digits: 6 digits
Duodecimal32066base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8472base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:15:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101001TT0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000111010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000000011001110
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 00 ce
Gray code11000000010101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000000011001110
64-bit0000000000000000000000000000000000000000000000010000000011001110
One's complement11111111111111101111111100110001at 32 bits, every bit flipped
Bits reversed01110011000000001000000000000000at 32 bits
Rotated left by 100000000000000100000000110011100at 32 bits, wrapping
Shifted left by 1100000000110011100= 131,484, no wrap
Shifted right by 11000000001100111= 32,871, discarding the low bit
These bits as a double3.24808637 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime65,761+19
Previous prime65,731−11
Distance to nearest prime11
Nearest square below65,536
Nearest square above66,049

Powers & multiples

65,742 to the power 24,322,010,564
65,742 to the power 3284,137,618,498,488
65,742 to the power 418,679,775,315,327,598,096
65,742 to the power 51,228,045,788,780,266,954,027,232
First ten multiples65,742, 131,484, 197,226, 262,968, 328,710, 394,452, 460,194, 525,936, 591,678, 657,420
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 2
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1122the total stopping time
Highest value reached561,6528× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,742 → 32,871 → 98,614 → 49,307 → 147,922 → 73,961 → 221,884 → 110,942 → 55,471 → 166,414 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,574,200%
65,742% as a decimal657.42
65,742% of 10065,742
65,742% of 1,000657,420
As a fraction of 10065,742/100

Read another way

As bytes64.201 KiB
As a 24-bit colour#0100CE

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “65742” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.