Nerdulator> put something in

Recognised as Number

97,695

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value97,695
Digit count5
Digit sum36
Digit product17,010
Multiplicative persistence2times 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 × 5 × 13 × 167
Distinct prime factors43, 5, 13, 167
Number of divisors24
Sum of divisors σ(n)183,456
Aliquot sum85,761sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)47,808integers below n that share no factor with it
Carmichael function λ(n)996the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 47,808
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 13, 15, 39, 45, 65, 117, 167, 195, 501, 585, 835, 1,503, 2,171, 2,505, 6,513, 7,515, 10,855, 19,539, 32,565, 97,69524 in total

Arithmetic

Previous number97,694
Next number97,696
Double195,390
Square root312.561993851≈irrational, shown to 9 decimal places
Cube root46.05648386≈
Negation-97,695
Reciprocal0.0000102359≈

Representations

Decimal97,695
Binary1011111011001111117 bits
Octal276637
Hexadecimal17D9F
Base 3623DR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, six hundred and ninety-five
Ordinalninety-seven thousand, six hundred and ninety-fifth
Scientific notation9.7695 × 10^4
Engineering notation97.695 × 10^3

In other bases

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

Bit-level

00000000000000010111110110011111
Bit length17 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits4within that length
Bit parityodd13 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 9f
Gray code11100001101010000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111110110011111
64-bit0000000000000000000000000000000000000000000000010111110110011111
One's complement11111111111111101000001001100000at 32 bits, every bit flipped
Bits reversed11111001101111101000000000000000at 32 bits
Rotated left by 100000000000000101111101100111110at 32 bits, wrapping
Shifted left by 1101111101100111110= 195,390, no wrap
Shifted right by 11011111011001111= 48,847, discarding the low bit
These bits as a double4.82677433 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime97,711+16
Previous prime97,687−8
Distance to nearest prime8
Nearest square below97,344
Nearest square above97,969

Powers & multiples

97,695 to the power 29,544,313,025
97,695 to the power 3932,431,660,977,375
97,695 to the power 491,093,911,119,184,650,625
97,695 to the power 58,899,419,646,788,744,442,809,375
First ten multiples97,695, 195,390, 293,085, 390,780, 488,475, 586,170, 683,865, 781,560, 879,255, 976,950
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 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 1221the total stopping time
Highest value reached30,456,160311× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,695 → 293,086 → 146,543 → 439,630 → 219,815 → 659,446 → 329,723 → 989,170 → 494,585 → 1,483,756 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,769,500%
97,695% as a decimal976.95
97,695% of 10097,695
97,695% of 1,000976,950
As a fraction of 10097,695/100

Read another way

As bytes95.405 KiB
As a 24-bit colour#017D9F

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 “97695” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.