Recognised as Number
97,691
- Positive
- Odd
- Composite
- 5 digits
97,691 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value97,691
Digit count5
Digit sum32
Digit product3,402
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 83 × 107
Distinct prime factors311, 83, 107
Number of divisors8
Sum of divisors σ(n)108,864
Aliquot sum11,173sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)86,920integers below n that share no factor with it
Carmichael function λ(n)21,730the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 86,920
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 83, 107, 913, 1,177, 8,881, 97,6918 in total
Arithmetic
Representations
Decimal97,691
Binary1011111011001101117 bits
Octal276633
Hexadecimal17D9B
Base 3623DN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, six hundred and ninety-one
Ordinalninety-seven thousand, six hundred and ninety-first
Scientific notation9.7691 × 10^4
Engineering notation97.691 × 10^3
In other bases
Ternary11222000012base 3; the most digit-efficient integer base after e: 11 digits
Quinary11111231base 5; one hand: 8 digits
Septenary554546base 7: 6 digits
Nonary158005base 9; each digit is two ternary digits: 6 digits
Duodecimal4864bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc44bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:8:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00T0001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000001011101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110110011011
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; 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 9b
Gray code11100001101010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110110011011
64-bit0000000000000000000000000000000000000000000000010111110110011011
One's complement11111111111111101000001001100100at 32 bits, every bit flipped
Bits reversed11011001101111101000000000000000at 32 bits
Rotated left by 100000000000000101111101100110110at 32 bits, wrapping
Shifted left by 1101111101100110110= 195,382, no wrap
Shifted right by 11011111011001101= 48,845, discarding the low bit
These bits as a double4.8265767 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,691 to the power 29,543,531,481
97,691 to the power 3932,317,133,910,371
97,691 to the power 491,078,993,128,838,053,361
97,691 to the power 58,897,597,917,749,318,270,889,451
First ten multiples97,691, 195,382, 293,073, 390,764, 488,455, 586,146, 683,837, 781,528, 879,219, 976,910
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached1,112,77611× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,691 → 293,074 → 146,537 → 439,612 → 219,806 → 109,903 → 329,710 → 164,855 → 494,566 → 247,283 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,769,100%
97,691% as a decimal976.91
97,691% of 10097,691
97,691% of 1,000976,910
As a fraction of 10097,691/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 97,691
Nerdulate something else
Nothing in mind? Surprise me · today’s page