Recognised as Number

97,642

Positive
Even
Composite
5 digits

97,642 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value97,642

Digit count5

Digit sum28

Digit product3,024

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 48,821

Distinct prime factors22, 48,821

Number of divisors4

Sum of divisors σ(n)146,466

Aliquot sum48,824sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)48,820integers below n that share no factor with it

Carmichael function λ(n)48,820the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 48,821, 97,6424 in total

Arithmetic

Previous number97,641

Next number97,643

Double195,284

Half48,821

Square9,533,960,164

Cube930,914,938,333,288

Square root312.477199168≈irrational, shown to 9 decimal places

Cube root46.048153733≈

Negation-97,642

Reciprocal0.0000102415≈

Representations

Decimal97,642

Binary1011111010110101017 bits

Octal276552

Hexadecimal17D6A

Base 3623CA

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsninety-seven thousand, six hundred and forty-two

Ordinalninety-seven thousand, six hundred and forty-second

Scientific notation9.7642 × 10^4

Engineering notation97.642 × 10^3

In other bases

Ternary11221221101base 3; the most digit-efficient integer base after e: 11 digits

Quinary11111032base 5; one hand: 8 digits

Septenary554446base 7: 6 digits

Nonary157841base 9; each digit is two ternary digits: 6 digits

Duodecimal4860abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalc422base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal27:7:22base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT00T0T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101000001010111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010111110101101010

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 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 7d 6a

Gray code11100001111011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111110101101010

64-bit0000000000000000000000000000000000000000000000010111110101101010

One's complement11111111111111101000001010010101at 32 bits, every bit flipped

Bits reversed01010110101111101000000000000000at 32 bits

Rotated left by 100000000000000101111101011010100at 32 bits, wrapping

Shifted left by 1101111101011010100= 195,284, no wrap

Shifted right by 11011111010110101= 48,821, discarding the low bit

These bits as a double4.82415578 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime97,649+7

Previous prime97,613−29

Distance to nearest prime7

Nearest square below97,344

Nearest square above97,969

Powers & multiples

97,642 to the power 29,533,960,164

97,642 to the power 3930,914,938,333,288

97,642 to the power 490,896,396,408,738,906,896

97,642 to the power 58,875,305,938,142,084,347,139,232

First ten multiples97,642, 195,284, 292,926, 390,568, 488,210, 585,852, 683,494, 781,136, 878,778, 976,420

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 10

Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time

Highest value reached146,4641× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps97,642 → 48,821 → 146,464 → 73,232 → 36,616 → 18,308 → 9,154 → 4,577 → 13,732 → 6,866 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,764,200%

97,642% as a decimal976.42

97,642% of 10097,642

97,642% of 1,000976,420

As a fraction of 10097,642/100

Read another way

As seconds1 day, 3 hours and 7 minutes

As bytes95.354 KiB

As a 24-bit colour#017D6A

Keep nerding

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