Recognised as Number
97,697
- Positive
- Odd
- Composite
- 5 digits
97,697 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value97,697
Digit count5
Digit sum38
Digit product23,814
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation151 × 647
Distinct prime factors2151, 647
Number of divisors4
Sum of divisors σ(n)98,496
Aliquot sum799sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)96,900integers below n that share no factor with it
Carmichael function λ(n)48,450the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 96,900
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 151, 647, 97,6974 in total
Arithmetic
Representations
Decimal97,697
Binary1011111011010000117 bits
Octal276641
Hexadecimal17DA1
Base 3623DT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, six hundred and ninety-seven
Ordinalninety-seven thousand, six hundred and ninety-seventh
Scientific notation9.7697 × 10^4
Engineering notation97.697 × 10^3
In other bases
Ternary11222000102base 3; the most digit-efficient integer base after e: 11 digits
Quinary11111242base 5; one hand: 8 digits
Septenary554555base 7: 6 digits
Nonary158012base 9; each digit is two ternary digits: 6 digits
Duodecimal48655base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc44hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:8:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00T00011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000001011100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110110100001
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 a1
Gray code11100001101110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110110100001
64-bit0000000000000000000000000000000000000000000000010111110110100001
One's complement11111111111111101000001001011110at 32 bits, every bit flipped
Bits reversed10000101101111101000000000000000at 32 bits
Rotated left by 100000000000000101111101101000010at 32 bits, wrapping
Shifted left by 1101111101101000010= 195,394, no wrap
Shifted right by 11011111011010000= 48,848, discarding the low bit
These bits as a double4.82687314 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,697 to the power 29,544,703,809
97,697 to the power 3932,488,928,027,873
97,697 to the power 491,101,370,801,539,108,481
97,697 to the power 58,900,330,623,197,966,281,268,257
First ten multiples97,697, 195,394, 293,091, 390,788, 488,485, 586,182, 683,879, 781,576, 879,273, 976,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 166the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,697 → 293,092 → 146,546 → 73,273 → 219,820 → 109,910 → 54,955 → 164,866 → 82,433 → 247,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,769,700%
97,697% as a decimal976.97
97,697% of 10097,697
97,697% of 1,000976,970
As a fraction of 10097,697/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,697
Nerdulate something else
Nothing in mind? Surprise me · today’s page