Recognised as Number

97,373

Positive
Odd
Prime
5 digits

97,373 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value97,373

Digit count5

Digit sum29

Digit product3,969

Multiplicative persistence4times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation97,373

Distinct prime factors197,373

Number of divisors2

Sum of divisors σ(n)97,374

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)97,372the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 97,3732 in total

Arithmetic

Previous number97,372

Next number97,374

Double194,746

Half48,686.5

Square9,481,501,129

Cube923,242,209,434,117

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

Cube root46.005827869≈

Negation-97,373

Reciprocal0.0000102698≈

Representations

Decimal97,373

Binary1011111000101110117 bits

Octal276135

Hexadecimal17C5D

Base 36234T

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

In wordsninety-seven thousand, three hundred and seventy-three

Ordinalninety-seven thousand, three hundred and seventy-third

Scientific notation9.7373 × 10^4

Engineering notation97.373 × 10^3

In other bases

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

Quinary11103443base 5; one hand: 8 digits

Septenary553613base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010111110001011101

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 5d

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

At each machine width

32-bit00000000000000010111110001011101

64-bit0000000000000000000000000000000000000000000000010111110001011101

One's complement11111111111111101000001110100010at 32 bits, every bit flipped

Bits reversed10111010001111101000000000000000at 32 bits

Rotated left by 100000000000000101111100010111010at 32 bits, wrapping

Shifted left by 1101111100010111010= 194,746, no wrap

Shifted right by 11011111000101110= 48,686, discarding the low bit

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

Nearest landmarks

Next prime97,379+6

Previous prime97,369−4

Distance to nearest prime0, it is prime

Nearest square below97,344

Nearest square above97,969

Powers & multiples

97,373 to the power 29,481,501,129

97,373 to the power 3923,242,209,434,117

97,373 to the power 489,898,863,659,228,274,641

97,373 to the power 58,753,722,051,090,034,786,618,093

First ten multiples97,373, 194,746, 292,119, 389,492, 486,865, 584,238, 681,611, 778,984, 876,357, 973,730

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time

Highest value reached292,1203× the starting value

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

First steps97,373 → 292,120 → 146,060 → 73,030 → 36,515 → 109,546 → 54,773 → 164,320 → 82,160 → 41,080 → …

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

As a percentage & fraction

As a percentage9,737,300%

97,373% as a decimal973.73

97,373% of 10097,373

97,373% of 1,000973,730

As a fraction of 10097,373/100

Read another way

As seconds1 day, 3 hours and 2 minutes

As bytes95.091 KiB

As a 24-bit colour#017C5D

Keep nerding

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