Recognised as Number

97,491

Positive
Odd
Composite
5 digits

97,491 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value97,491

Digit count5

Digit sum30

Digit product2,268

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 32,497

Distinct prime factors23, 32,497

Number of divisors4

Sum of divisors σ(n)129,992

Aliquot sum32,501sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)64,992integers below n that share no factor with it

Carmichael function λ(n)32,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,992

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 32,497, 97,4914 in total

Arithmetic

Previous number97,490

Next number97,492

Double194,982

Half48,745.5

Square9,504,495,081

Cube926,602,729,941,771

Square root312.235488053≈irrational, shown to 9 decimal places

Cube root46.02440419≈

Negation-97,491

Reciprocal0.0000102574≈

Representations

Decimal97,491

Binary1011111001101001117 bits

Octal276323

Hexadecimal17CD3

Base 362383

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsninety-seven thousand, four hundred and ninety-one

Ordinalninety-seven thousand, four hundred and ninety-first

Scientific notation9.7491 × 10^4

Engineering notation97.491 × 10^3

In other bases

Ternary11221201210base 3; the most digit-efficient integer base after e: 11 digits

Quinary11104431base 5; one hand: 8 digits

Septenary554142base 7: 6 digits

Nonary157653base 9; each digit is two ternary digits: 6 digits

Duodecimal48503base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalc3ebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal27:4:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT00TT1TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101000110111010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010111110011010011

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 odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 7c d3

Gray code11100001010111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111110011010011

64-bit0000000000000000000000000000000000000000000000010111110011010011

One's complement11111111111111101000001100101100at 32 bits, every bit flipped

Bits reversed11001011001111101000000000000000at 32 bits

Rotated left by 100000000000000101111100110100110at 32 bits, wrapping

Shifted left by 1101111100110100110= 194,982, no wrap

Shifted right by 11011111001101001= 48,745, discarding the low bit

These bits as a double4.81669539 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime97,499+8

Previous prime97,463−28

Distance to nearest prime8

Nearest square below97,344

Nearest square above97,969

Powers & multiples

97,491 to the power 29,504,495,081

97,491 to the power 3926,602,729,941,771

97,491 to the power 490,335,426,744,753,196,561

97,491 to the power 58,806,891,088,772,733,885,928,451

First ten multiples97,491, 194,982, 292,473, 389,964, 487,455, 584,946, 682,437, 779,928, 877,419, 974,910

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 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1177the total stopping time

Highest value reached1,054,13210× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps97,491 → 292,474 → 146,237 → 438,712 → 219,356 → 109,678 → 54,839 → 164,518 → 82,259 → 246,778 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,749,100%

97,491% as a decimal974.91

97,491% of 10097,491

97,491% of 1,000974,910

As a fraction of 10097,491/100

Read another way

As seconds1 day, 3 hours and 4 minutes

As bytes95.206 KiB

As a 24-bit colour#017CD3

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.