Recognised as Number

97,641

Positive
Odd
Composite
5 digits

97,641 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value97,641

Digit count5

Digit sum27

Digit product1,512

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 19 × 571

Distinct prime factors33, 19, 571

Number of divisors12

Sum of divisors σ(n)148,720

Aliquot sum51,079sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,710the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 61,560

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 19, 57, 171, 571, 1,713, 5,139, 10,849, 32,547, 97,64112 in total

Arithmetic

Previous number97,640

Next number97,642

Double195,282

Half48,820.5

Square9,533,764,881

Cube930,886,336,745,721

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

Cube root46.047996532≈

Negation-97,641

Reciprocal0.0000102416≈

Representations

Decimal97,641

Binary1011111010110100117 bits

Octal276551

Hexadecimal17D69

Base 3623C9

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

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

Ordinalninety-seven thousand, six hundred and forty-first

Scientific notation9.7641 × 10^4

Engineering notation97.641 × 10^3

In other bases

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

Quinary11111031base 5; one hand: 8 digits

Septenary554445base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010111110101101001

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 odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 7d 69

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

At each machine width

32-bit00000000000000010111110101101001

64-bit0000000000000000000000000000000000000000000000010111110101101001

One's complement11111111111111101000001010010110at 32 bits, every bit flipped

Bits reversed10010110101111101000000000000000at 32 bits

Rotated left by 100000000000000101111101011010010at 32 bits, wrapping

Shifted left by 1101111101011010010= 195,282, no wrap

Shifted right by 11011111010110100= 48,820, discarding the low bit

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

Nearest landmarks

Next prime97,649+8

Previous prime97,613−28

Distance to nearest prime8

Nearest square below97,344

Nearest square above97,969

Powers & multiples

97,641 to the power 29,533,764,881

97,641 to the power 3930,886,336,745,721

97,641 to the power 490,892,672,806,188,944,161

97,641 to the power 58,874,851,465,469,094,696,824,201

First ten multiples97,641, 195,282, 292,923, 390,564, 488,205, 585,846, 683,487, 781,128, 878,769, 976,410

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 9

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 166the total stopping time

Highest value reached741,4727× the starting value

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

First steps97,641 → 292,924 → 146,462 → 73,231 → 219,694 → 109,847 → 329,542 → 164,771 → 494,314 → 247,157 → …

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

As a percentage & fraction

As a percentage9,764,100%

97,641% as a decimal976.41

97,641% of 10097,641

97,641% of 1,000976,410

As a fraction of 10097,641/100

Read another way

As seconds1 day, 3 hours and 7 minutes

As bytes95.353 KiB

As a 24-bit colour#017D69

Keep nerding

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