Nerdulator> put something in

Recognised as Number

97,690

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value97,690
Digit count5
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 9,769
Distinct prime factors32, 5, 9,769
Number of divisors8
Sum of divisors σ(n)175,860
Aliquot sum78,170sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)39,072integers below n that share no factor with it
Carmichael function λ(n)9,768the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 39,072
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 9,769, 19,538, 48,845, 97,6908 in total

Arithmetic

Previous number97,689
Next number97,691
Double195,380
Half48,845
Square root312.553995335≈irrational, shown to 9 decimal places
Cube root46.055698127≈
Negation-97,690
Reciprocal0.0000102365≈

Representations

Decimal97,690
Binary1011111011001101017 bits
Octal276632
Hexadecimal17D9A
Base 3623DM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, six hundred and ninety
Ordinalninety-seven thousand, six hundred and ninetieth
Scientific notation9.769 × 10^4
Engineering notation97.69 × 10^3

In other bases

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

Bit-level

00000000000000010111110110011010
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 9a
Gray code11100001101010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111110110011010
64-bit0000000000000000000000000000000000000000000000010111110110011010
One's complement11111111111111101000001001100101at 32 bits, every bit flipped
Bits reversed01011001101111101000000000000000at 32 bits
Rotated left by 100000000000000101111101100110100at 32 bits, wrapping
Shifted left by 1101111101100110100= 195,380, no wrap
Shifted right by 11011111011001101= 48,845, discarding the low bit
These bits as a double4.82652729 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime97,711+21
Previous prime97,687−3
Distance to nearest prime3
Nearest square below97,344
Nearest square above97,969

Powers & multiples

97,690 to the power 29,543,336,100
97,690 to the power 3932,288,503,609,000
97,690 to the power 491,075,263,917,563,210,000
97,690 to the power 58,897,142,532,106,749,984,900,000
First ten multiples97,690, 195,380, 293,070, 390,760, 488,450, 586,140, 683,830, 781,520, 879,210, 976,900
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time
Highest value reached146,5361× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,690 → 48,845 → 146,536 → 73,268 → 36,634 → 18,317 → 54,952 → 27,476 → 13,738 → 6,869 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,769,000%
97,690% as a decimal976.9
97,690% of 10097,690
97,690% of 1,000976,900
As a fraction of 10097,690/100

Read another way

As bytes95.4 KiB
As a 24-bit colour#017D9A

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