Recognised as Number

97,489

Positive
Odd
Composite
5 digits

97,489 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value97,489

Digit count5

Digit sum37

Digit product18,144

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 19 × 733

Distinct prime factors37, 19, 733

Number of divisors8

Sum of divisors σ(n)117,440

Aliquot sum19,951sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,196the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 79,056

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 19, 133, 733, 5,131, 13,927, 97,4898 in total

Arithmetic

Previous number97,488

Next number97,490

Double194,978

Half48,744.5

Square9,504,105,121

Cube926,545,704,141,169

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

Cube root46.024089462≈

Negation-97,489

Reciprocal0.0000102576≈

Representations

Decimal97,489

Binary1011111001101000117 bits

Octal276321

Hexadecimal17CD1

Base 362381

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

In wordsninety-seven thousand, four hundred and eighty-nine

Ordinalninety-seven thousand, four hundred and eighty-ninth

Scientific notation9.7489 × 10^4

Engineering notation97.489 × 10^3

In other bases

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

Quinary11104424base 5; one hand: 8 digits

Septenary554140base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010111110011010001

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 odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 7c d1

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

At each machine width

32-bit00000000000000010111110011010001

64-bit0000000000000000000000000000000000000000000000010111110011010001

One's complement11111111111111101000001100101110at 32 bits, every bit flipped

Bits reversed10001011001111101000000000000000at 32 bits

Rotated left by 100000000000000101111100110100010at 32 bits, wrapping

Shifted left by 1101111100110100010= 194,978, no wrap

Shifted right by 11011111001101000= 48,744, discarding the low bit

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

Nearest landmarks

Next prime97,499+10

Previous prime97,463−26

Distance to nearest prime10

Nearest square below97,344

Nearest square above97,969

Powers & multiples

97,489 to the power 29,504,105,121

97,489 to the power 3926,545,704,141,169

97,489 to the power 490,328,014,151,018,424,641

97,489 to the power 58,805,987,771,568,635,199,826,449

First ten multiples97,489, 194,978, 292,467, 389,956, 487,445, 584,934, 682,423, 779,912, 877,401, 974,890

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 89

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,489 → 292,468 → 146,234 → 73,117 → 219,352 → 109,676 → 54,838 → 27,419 → 82,258 → 41,129 → …

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

As a percentage & fraction

As a percentage9,748,900%

97,489% as a decimal974.89

97,489% of 10097,489

97,489% of 1,000974,890

As a fraction of 10097,489/100

Read another way

As seconds1 day, 3 hours and 4 minutes

As bytes95.204 KiB

As a 24-bit colour#017CD1

Keep nerding

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