Recognised as Number
97,692
- Positive
- Even
- Composite
- 5 digits
97,692 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value97,692
Digit count5
Digit sum33
Digit product6,804
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 7 × 1,163
Distinct prime factors42, 3, 7, 1,163
Number of divisors24
Sum of divisors σ(n)260,736
Aliquot sum163,044sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)27,888integers below n that share no factor with it
Carmichael function λ(n)3,486the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,888
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 1,163, 2,326, 3,489, 4,652, 6,978, 8,141, 13,956, 16,282, 24,423, 32,564, 48,846, 97,69224 in total
Arithmetic
Representations
Decimal97,692
Binary1011111011001110017 bits
Octal276634
Hexadecimal17D9C
Base 3623DO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, six hundred and ninety-two
Ordinalninety-seven thousand, six hundred and ninety-second
Scientific notation9.7692 × 10^4
Engineering notation97.692 × 10^3
In other bases
Ternary11222000020base 3; the most digit-efficient integer base after e: 11 digits
Quinary11111232base 5; one hand: 8 digits
Septenary554550base 7: 6 digits
Nonary158006base 9; each digit is two ternary digits: 6 digits
Duodecimal48650base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc44cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:8:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00T0001T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000001011101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110110011100
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 22 trailing zeros
Power of twoNo
Bytes301 7d 9c
Gray code11100001101010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110110011100
64-bit0000000000000000000000000000000000000000000000010111110110011100
One's complement11111111111111101000001001100011at 32 bits, every bit flipped
Bits reversed00111001101111101000000000000000at 32 bits
Rotated left by 100000000000000101111101100111000at 32 bits, wrapping
Shifted left by 1101111101100111000= 195,384, no wrap
Shifted right by 11011111011001110= 48,846, discarding the low bit
These bits as a double4.82662611 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,692 to the power 29,543,726,864
97,692 to the power 3932,345,764,797,888
97,692 to the power 491,082,722,454,635,274,496
97,692 to the power 58,898,053,322,038,229,236,063,232
First ten multiples97,692, 195,384, 293,076, 390,768, 488,460, 586,152, 683,844, 781,536, 879,228, 976,920
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12Yes
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached2,112,64021× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,692 → 48,846 → 24,423 → 73,270 → 36,635 → 109,906 → 54,953 → 164,860 → 82,430 → 41,215 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,769,200%
97,692% as a decimal976.92
97,692% of 10097,692
97,692% of 1,000976,920
As a fraction of 10097,692/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,692
Nerdulate something else
Nothing in mind? Surprise me · today’s page