Recognised as Number
97,384
- Positive
- Even
- Composite
- 5 digits
97,384 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value97,384
Digit count5
Digit sum31
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 7 × 37 × 47
Distinct prime factors42, 7, 37, 47
Number of divisors32
Sum of divisors σ(n)218,880
Aliquot sum121,496sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)39,744integers below n that share no factor with it
Carmichael function λ(n)828the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 39,744
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 28, 37, 47, 56, 74, 94, 148, 188, 259, 296, 329, 376, 518, 658, 1,036, 1,316, 1,739, 2,072, 2,632, 3,478, 6,956, 12,173, 13,912, 24,346, 48,692, 97,38432 in total
Arithmetic
Representations
Decimal97,384
Binary1011111000110100017 bits
Octal276150
Hexadecimal17C68
Base 362354
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, three hundred and eighty-four
Ordinalninety-seven thousand, three hundred and eighty-fourth
Scientific notation9.7384 × 10^4
Engineering notation97.384 × 10^3
In other bases
Ternary11221120211base 3; the most digit-efficient integer base after e: 11 digits
Quinary11104014base 5; one hand: 8 digits
Septenary553630base 7: 6 digits
Nonary157524base 9; each digit is two ternary digits: 6 digits
Duodecimal48434base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc394base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:3:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00TTT1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110110111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110001101000
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes301 7c 68
Gray code11100001001011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110001101000
64-bit0000000000000000000000000000000000000000000000010111110001101000
One's complement11111111111111101000001110010111at 32 bits, every bit flipped
Bits reversed00010110001111101000000000000000at 32 bits
Rotated left by 100000000000000101111100011010000at 32 bits, wrapping
Shifted left by 1101111100011010000= 194,768, no wrap
Shifted right by 11011111000110100= 48,692, discarding the low bit
These bits as a double4.81140889 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,384 to the power 29,483,643,456
97,384 to the power 3923,555,134,319,104
97,384 to the power 489,939,493,200,531,623,936
97,384 to the power 58,758,667,605,840,571,665,383,424
First ten multiples97,384, 194,768, 292,152, 389,536, 486,920, 584,304, 681,688, 779,072, 876,456, 973,840
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 84
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached97,384
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,384 → 48,692 → 24,346 → 12,173 → 36,520 → 18,260 → 9,130 → 4,565 → 13,696 → 6,848 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,738,400%
97,384% as a decimal973.84
97,384% of 10097,384
97,384% of 1,000973,840
As a fraction of 10097,384/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,384
Nerdulate something else
Nothing in mind? Surprise me · today’s page