Recognised as Number
97,382
- Positive
- Even
- Composite
- 5 digits
97,382 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value97,382
Digit count5
Digit sum29
Digit product3,024
Multiplicative persistence2times 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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 23 × 29 × 73
Distinct prime factors42, 23, 29, 73
Number of divisors16
Sum of divisors σ(n)159,840
Aliquot sum62,458sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)44,352integers below n that share no factor with it
Carmichael function λ(n)5,544the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,352
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 23, 29, 46, 58, 73, 146, 667, 1,334, 1,679, 2,117, 3,358, 4,234, 48,691, 97,38216 in total
Arithmetic
Representations
Decimal97,382
Binary1011111000110011017 bits
Octal276146
Hexadecimal17C66
Base 362352
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, three hundred and eighty-two
Ordinalninety-seven thousand, three hundred and eighty-second
Scientific notation9.7382 × 10^4
Engineering notation97.382 × 10^3
In other bases
Ternary11221120202base 3; the most digit-efficient integer base after e: 11 digits
Quinary11104012base 5; one hand: 8 digits
Septenary553625base 7: 6 digits
Nonary157522base 9; each digit is two ternary digits: 6 digits
Duodecimal48432base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc392base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:3:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00TTT1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110110111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110001100110
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 7c 66
Gray code11100001001010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110001100110
64-bit0000000000000000000000000000000000000000000000010111110001100110
One's complement11111111111111101000001110011001at 32 bits, every bit flipped
Bits reversed01100110001111101000000000000000at 32 bits
Rotated left by 100000000000000101111100011001100at 32 bits, wrapping
Shifted left by 1101111100011001100= 194,764, no wrap
Shifted right by 11011111000110011= 48,691, discarding the low bit
These bits as a double4.81131007 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,382 to the power 29,483,253,924
97,382 to the power 3923,498,233,626,968
97,382 to the power 489,932,104,987,061,397,776
97,382 to the power 58,757,768,247,850,013,038,222,432
First ten multiples97,382, 194,764, 292,146, 389,528, 486,910, 584,292, 681,674, 779,056, 876,438, 973,820
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,382 → 48,691 → 146,074 → 73,037 → 219,112 → 109,556 → 54,778 → 27,389 → 82,168 → 41,084 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,738,200%
97,382% as a decimal973.82
97,382% of 10097,382
97,382% of 1,000973,820
As a fraction of 10097,382/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,382
Nerdulate something else
Nothing in mind? Surprise me · today’s page